A NEW UNIVERSAL RANDOM CODING BOUND FOR THE MULTIPLE-ACCESS CHANNEL

Authors
LIU YS HUGHES BL
Citation
Ys. Liu et Bl. Hughes, A NEW UNIVERSAL RANDOM CODING BOUND FOR THE MULTIPLE-ACCESS CHANNEL, IEEE transactions on information theory, 42(2), 1996, pp. 376-386
Citations number
17
Categorie Soggetti
Information Science & Library Science","Engineering, Eletrical & Electronic
Journal title
IEEE transactions on information theory → ACNP
ISSN journal
00189448
Volume
42
Issue
2
Year of publication
1996
Pages
376 - 386
Database
ISI
SICI code
0018-9448(1996)42:2<376:ANURCB>2.0.ZU;2-N
Abstract
The minimum average error probability achievable by block codes on the two-user multiple-access channel is investigated. A new exponential u pper bound is found which can be achieved universally for all discrete memoryless multiple-access channels with given input and output alpha bets. It is shown that the exponent of this bound is greater than or e qual to those of previously known bounds. Moreover, examples are given where the new exponent is strictly larger.