Random coding bound and codes produced by permutations for the multiple-access channel

Authors:
Jutta Pokorny;Hans-Martin Wallmeier
Affiliations:
Univ. Bielefeld, Bielefeld, W. Germany;Univ. Bielefeld, Bielefeld, W. Germany
Venue:
IEEE Transactions on Information Theory
Year:
1985

Citing 0
Cited 5

Reliability criteria in information theory and in statistical hypothesis testing

Foundations and Trends in Communications and Information Theory
New bounds on the maximal error exponent for multiple-access channels

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Interference channel capacity region for randomized fixed-composition codes

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Error exponents of optimum decoding for the interference channel

IEEE Transactions on Information Theory
Bounds of E-capacity for multiple-access channel with random parameter

General Theory of Information Transfer and Combinatorics

Quantified Score

Hi-index	754.90

Visualization

Abstract

A random coding bound for the multiple-access channel (MAC) is given, and it is shown to be obtainable universally for all MAC's with common input and output alphabets. For channels for which the random coding bound may be achieved by codes consisting of codewords of a single type for each sender, this bound is also achievable by codes produced by permutations.