Random Coding Bound and Codes Produced by Permutations for the Multiple-Access Channel

IEEE Transactions on Information Theory

Volumn 31, Issue 6, 1985, Pages 741-750

  Pokorny, Jutta ^a   Wallmeier, Hans Martin ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC - ENCODING; INFORMATION THEORY - CHANNEL CAPACITY;

CODING/DECODING; MULTIPLE ACCESS CHANNEL (MAC); PERMUTATION CODING; RANDOM CODING ERROR BOUND;

DIGITAL COMMUNICATION SYSTEMS;

EID: 0022148205     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1985.1057104     Document Type: Article

References (8)

1. R. Ahlswede, “Multiway communication channels,” in Proc. 2 nd Int. Symp. Information Theory, Tsahkadsor, Armenian SSR, 1971, pp. 23–52.
2. — “The capacity region of a channel with two senders and two receivers,” Ann. Probab., vol. 2, pp. 805–814, 1974.
3. R. Ahlswede and G. Dueck, “Good codes can be produced by a few permutations,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 430–443, 1982.
4. M. Bierbaum and H. M. Wallmeier, “A note on the capacity region of the multiple-access channel,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 484, 1979.
5. I. Cziszar and J. Körner, Information Theory, Coding Theorems for Discrete Memoryless Systems. Budapest: Akademiai Kiado, 1981.
6. — “Graph decomposition: A new key to coding theorems,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 5–12, 1981.
7. I. Csiszar, J. Korner, and K. Marton, “A new look at the error exponent of a discrete, memoryless channel,” IEEE Symp. Information Theory, Cornell Univ., Ithaca, NY, 1977 (preprint).
8. C. E. Shannon, “Two-way communication channels,” in Proc. 4th Berkeley Symp. Mathematics, Statistics, and Probability, 1961, vol. 1, pp. 611–644.