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
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information, Physics, and Computation
Information, Physics, and Computation
Relations between random coding exponents and the statistical physics of random codes
IEEE Transactions on Information Theory
Interference channel capacity region for randomized fixed-composition codes
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
A new universal random coding bound for the multiple-access channel
IEEE Transactions on Information Theory
Error Exponent Regions for Gaussian Broadcast and Multiple-Access Channels
IEEE Transactions on Information Theory
Error Exponents of Erasure/List Decoding Revisited Via Moments of Distance Enumerators
IEEE Transactions on Information Theory
Gaussian Interference Channel Capacity to Within One Bit
IEEE Transactions on Information Theory
Error Exponents for Broadcast Channels With Degraded Message Sets
IEEE Transactions on Information Theory
| Hi-index | 754.84 |
Exponential error bounds for the finite-alphabet interference channel (IFC) with two transmitter-receiver pairs, are investigated under the random coding regime. Our focus is on optimum decoding, as opposed to heuristic decoding rules that have been used in previous works, like joint typicality decoding, decoding based on interference cancellation, and decoding that considers the interference as additional noise. Indeed, the fact that the actual interfering signal is a codeword and not an independent and identically distributed (i.i.d.) noise process complicates the application of conventional techniques to the performance analysis of the optimum decoder. Using analytical tools rooted in statistical physics, we derive a single-letter expression for error exponents achievable under optimum decoding and demonstrate strict improvement over error exponents obtainable using suboptimal decoding rules, but which are amenable to more conventional analysis.