DocumentCode
2938991
Title
A new universal random coding bound for the multiple-access channel
Author
Liu, Yu-Sun ; Hughes, Brian
Author_Institution
Dept. of Electr. & Comput. Eng., Johns Hopkins Univ., Baltimore, MD, USA
fYear
1995
fDate
17-22 Sep 1995
Firstpage
442
Abstract
The minimum average error probability achievable by block codes on the two-user multiple-access channel is investigated. A new exponential upper bound is found which can be achieved universally for all discrete memoryless multiple-access channels with given input and output alphabets. It is shown that the exponent of this bound is greater than or equal to those of previously known bounds. Moreover, examples are given where the new exponent is strictly larger
Keywords
block codes; error statistics; memoryless systems; multi-access systems; telecommunication channels; block codes; discrete memoryless channels; exponential upper bound; minimum average error probability; multiple-access channel; multiuser information theory; two-user channel; universal random coding bound; Block codes; Communication system control; Decoding; Error probability; Information theory; Notice of Violation; Random variables; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location
Whistler, BC
Print_ISBN
0-7803-2453-6
Type
conf
DOI
10.1109/ISIT.1995.550429
Filename
550429
Link To Document