Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel

We relate coding for the two-user multiple-access binary adder channel to a problem in graph theory, known as the independent set problem. Graph-theoretic approaches to coding for both synchronized and nonsynchronized two-user adder channels are presented. Using the Tuŕan theorem on the independence number of a simple graph, we are able to improve the lower bounds on the achievable rates of uniquely and \delta -decodable codes for the synchronized adder channel derived by Kasami and Lin. We are also able to derive lower bounds on the achievable rates of uniquely decodable codes for the nonsynchronized adder channel. We show that the rates of Deaett-Wolf codes for the nonsynchronized adder channel fall below the bounds. Synchronizing sequences for the nonsynchronized adder channel are constructed.

[1]  Jack K. Wolf,et al.  Some very simple codes for the nonsynchronized two-user multiple-access adder channel with binary inputs (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[2]  Henk C. A. van Tilborg,et al.  An upper bound for codes in a two-access binary erasure channel (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[3]  Shu Lin,et al.  Coding for a multiple-access channel , 1976, IEEE Trans. Inf. Theory.

[4]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

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

[6]  P. Turán.  On the theory of graphs , 1954 .

[7]  Daniel J. Costello,et al.  Binary convolutional codes for a multiple-access channel (Corresp.) , 1979, IEEE Trans. Inf. Theory.

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

[9]  Shijun Zhang.  Coding for a T-user multiple-access channel , 1977 .

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

[11]  TADAO KASAMI,et al.  Bounds on the achievable rates of block coding for a memoryless multiple-access channel , 1978, IEEE Trans. Inf. Theory.

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

[13]  S. Golomb,et al.  Comma-Free Codes , 1958, Canadian Journal of Mathematics.

[14]  Pierre R. Chevillat.  N-user trellis coding for a class of multiple-access channels , 1981, IEEE Trans. Inf. Theory.

[15]  Shu Lin,et al.  Decoding of linear Delta -decodable codes for a multiple- access channel (Corresp.) , 1978, IEEE Trans. Inf. Theory.

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

[17]  Robert J. McEliece,et al.  New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities , 1977, IEEE Trans. Inf. Theory.

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

[19]  Jack K. Wolf,et al.  On the T-user M-frequency noiseless multiple-access channel with and without intensity information , 1981, IEEE Trans. Inf. Theory.

[20]  Shu Lin,et al.  Existence of Good δ-Decodable Codes for the Two-User Multiple-Access Adder Channel , 1980, IBM J. Res. Dev..

[21]  E. J. Weldon.  Coding for a Multiple-Access Channel , 1978, Inf. Control..

[22]  Jack K. Wolf,et al.  The capacity region of a multiple-access discrete memoryless channel can increase with feedback (Corresp.) , 1975, IEEE Trans. Inf. Theory.