Rate-splitting multiple access for discrete memoryless channels

It is shown that the encoding/decoding problem for any asynchronous M-user discrete memoryless multiple-access channel can be reduced to corresponding problems for at most 2M-1 single-user discrete memoryless channels. This result, which extends a similar result for Gaussian channels, reduces the seemingly hard task of finding good multiple-access codes to the much better understood task of finding good codes for single-user channels. As a by-product, some interesting properties of the capacity region of M-user asynchronous discrete memoryless channels are derived.

[1]  David Tse,et al.  Multiaccess Fading Channels-Part I: Polymatroid Structure, Optimal Resource Allocation and Throughput Capacities , 1998, IEEE Trans. Inf. Theory.

[2]  Bixio Rimoldi.  Time-Splitting Multiple-Access , 1999 .

[3]  Hans-Martin Wallmeier,et al.  A note on the capacity region of the multiple-access channel (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[4]  van der MeulenE..  A Survey of Multi-Way Channels in Information Theory: , 1977 .

[5]  A. Sridharan.  Broadcast Channels , 2022 .

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

[7]  G. Ziegler.  Lectures on Polytopes , 1994 .

[8]  Thomas M. Cover,et al.  Cooperative broadcasting , 1974, IEEE Trans. Inf. Theory.

[9]  Rudolf Ahlswede,et al.  Multi-way communication channels , 1973 .

[10]  Robert G. Gallager,et al.  A perspective on multiaccess channels , 1984, IEEE Trans. Inf. Theory.

[11]  A. El Gamal,et al.  Multiple user information theory , 1980, Proceedings of the IEEE.

[12]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[13]  Pierre A. Humblet,et al.  The capacity region of the totally asynchronous multiple-access channel , 1985, IEEE Trans. Inf. Theory.

[14]  Jacob Wolfowitz,et al.  Multiple Access Channels , 1978 .

[15]  W. Massey.  A basic course in algebraic topology , 1991 .

[16]  Edward C. van der Meulen,et al.  A survey of multi-way channels in information theory: 1961-1976 , 1977, IEEE Trans. Inf. Theory.

[17]  D. Slepian,et al.  A coding theorem for multiple access channels with correlated sources , 1973 .

[18]  Robert J. McEliece,et al.  Asynchronous multiple-access channel capacity , 1981, IEEE Trans. Inf. Theory.

[19]  Peter Mathys,et al.  A class of codes for a T active users out of N multiple-access communication system , 1990, IEEE Trans. Inf. Theory.

[20]  Rüdiger L. Urbanke,et al.  A rate-splitting approach to the Gaussian multiple-access channel , 1996, IEEE Trans. Inf. Theory.

[21]  E. J. Weldon,et al.  Coding for T-user multiple-access channels , 1979, IEEE Trans. Inf. Theory.

[22]  James L. Massey,et al.  The collision channel without feedback , 1985, IEEE Trans. Inf. Theory.

[23]  H. Piaggio.  Mathematical Analysis , 1955, Nature.

[24]  Aaron D. Wyner,et al.  Recent results in the Shannon theory , 1974, IEEE Trans. Inf. Theory.

[25]  Stephen V. Hanly,et al.  Constraints on capacity in a multi-user channel , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[26]  Bixio Rimoldi.  Generalized time sharing for multiple access channels , 1997, Proceedings of IEEE International Symposium on Information Theory.

[27]  N. Steenrod,et al.  Foundations of Algebraic Topology , 1952 .

[28]  Jack Edmonds,et al.  Submodular Functions, Matroids, and Certain Polyhedra , 2001, Combinatorial Optimization.