Interference channel capacity region for randomized fixed-composition codes
Cheng Chang · 2009
The randomized fixed-composition codes with optimal decoding error exponents are recently studied in for the finite alphabet interference channel with two transmitter-receiver pairs. In this paper we investigate the capacity region for randomized fixed-composition codes. A complete characterization of the capacity region of the said coding scheme is given. The inner bound is derived by showing the existence of a positive error exponent within the capacity region. A simple universal decoding rule is given. The tight outer bound is derived by extending a technique first developed in for single input output channels to interference channels. It is shown that even with a sophisticated time-sharing scheme among randomized fixed-composition codes, the capacity region of the randomized fixed-composition coding is not bigger than the known Han-Kobayashi capacity region. This suggests that the study of the average behavior of randomized codes are not sufficient in finding new capacity regions.