Minimal-rate description for multiple-access channels

In this paper we consider the problem of a two-user multiple-access channel that is different from the conventional one. We require the receiver to provide only a reliable information-mixture of the incoming messages from the two users, not the exact contents. The minimum rate of such mixture is termed the minimal description rate of the channel output. Answers to this problem have many potential applications to the latest network-coding-based wireless communication networks. Exact capacity regions of a class of fading multiple-access channels are determined, along with the corresponding deterministic capacity-achieving coding schemes.

[1]  Yuhong Yang Elements of Information Theory (2nd ed.). Thomas M. Cover and Joy A. Thomas , 2008 .

[2]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[3]  Simon Litsyn,et al.  Lattices which are good for (almost) everything , 2005, IEEE Transactions on Information Theory.

[4]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[5]  N. J. A. Sloane,et al.  Sphere Packings, Lattices and Groups , 1987, Grundlehren der mathematischen Wissenschaften.

[6]  C. A. Rogers,et al.  Packing and Covering , 1964 .

[7]  L. Vulakh Diophantine approximation in ⁿ , 1995 .

[8]  Uri Erez,et al.  Achieving 1/2 log (1+SNR) on the AWGN channel with lattice encoding and decoding , 2004, IEEE Transactions on Information Theory.

[9]  Gregory Poltyrev,et al.  On coding without restrictions for the AWGN channel , 1993, IEEE Trans. Inf. Theory.

[10]  Hans-Andrea Loeliger,et al.  Averaging bounds for lattices and linear codes , 1997, IEEE Trans. Inf. Theory.

[11]  W. Fischer,et al.  Sphere Packings, Lattices and Groups , 1990 .