DocumentCode :
761457
Title :
A new universal random coding bound for the multiple-access channel
Author :
Liu, Yu-Sun ; Hughes, Brian L.
Author_Institution :
Dept. of Electr. & Comput. Eng., Johns Hopkins Univ., Baltimore, MD, USA
Volume :
42
Issue :
2
fYear :
1996
fDate :
3/1/1996 12:00:00 AM
Firstpage :
376
Lastpage :
386
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; channel coding; coding errors; error statistics; multi-access systems; probability; telecommunication channels; block codes; discrete memoryless multiple-access channels; exponential upper bound; input alphabet; minimum average error probability; multiple-access channel; output alphabet; universal random coding bound; Block codes; Decoding; Error probability; Information theory; Random variables; Stochastic processes; Terminology; Upper bound;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.485710
Filename :
485710
Link To Document :
بازگشت