Random coding bound and codes produced by permutations for the multiple-access channel
IEEE Transactions on Information Theory
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
A new universal random coding bound for the multiple-access channel
IEEE Transactions on Information Theory
The method of types [information theory]
IEEE Transactions on Information Theory
Outer bounds on the capacity of Gaussian interference channels
IEEE Transactions on Information Theory
On achievable rate regions for the Gaussian interference channel
IEEE Transactions on Information Theory
On The Han–Kobayashi Region for theInterference Channel
IEEE Transactions on Information Theory
Gaussian Interference Channel Capacity to Within One Bit
IEEE Transactions on Information Theory
Error exponents of optimum decoding for the interference channel
IEEE Transactions on Information Theory
| Hi-index | 0.06 |
The randomized fixed-composition codes with optimal decoding error exponents are recently studied in [11], [12] 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 [10] 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 [24] capacity region. This suggests that the study of the average behavior of randomized codes are not sufficient in finding new capacity regions.