  This paper investigates the achievability of the interference channel coding.
It is clarified that the rate-splitting technique is unnecessary to achieve
Han-Kobayashi and Jian-Xin-Garg inner regions. Codes are constructed by using
sparse matrices (with logarithmic column degree) and the
constrained-random-number generators. By extending the problem, we can
establish a possible extension of known inner regions.
