TY - GEN
T1 - Multirate achievability in memoryless multiaccess channel
AU - Cheng, Roger S.
PY - 1994
Y1 - 1994
N2 - The capacity region of a discrete memoryless multiaccess channel (MAC) is defined as the set of all achievable rate tuples, and a rate tuple is achievable if there exists coders and decoder with those rates and average error probability approaching zero asymptotically in the codeword length. Notice that this definition allows different rate tuples to be achieved by different coders-decoder pairs. A theorem giving the necessary and sufficient condition for a vector rate tuple to be multirate achievable is included.
AB - The capacity region of a discrete memoryless multiaccess channel (MAC) is defined as the set of all achievable rate tuples, and a rate tuple is achievable if there exists coders and decoder with those rates and average error probability approaching zero asymptotically in the codeword length. Notice that this definition allows different rate tuples to be achieved by different coders-decoder pairs. A theorem giving the necessary and sufficient condition for a vector rate tuple to be multirate achievable is included.
UR - https://www.scopus.com/pages/publications/84894381793
U2 - 10.1109/ISIT.1994.394912
DO - 10.1109/ISIT.1994.394912
M3 - Conference Paper published in a book
AN - SCOPUS:84894381793
SN - 0780320158
SN - 9780780320154
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 58
BT - Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994
T2 - 1994 IEEE International Symposium on Information Theory, ISIT 1994
Y2 - 27 June 1994 through 1 July 1994
ER -