Title :
Multirate achievability in memoryless multiaccess channel
Author_Institution :
Dept. of Electr. & Comput. Eng., Colorado Univ., Boulder, CO, USA
fDate :
27 Jun-1 Jul 1994
Abstract :
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
Keywords :
channel capacity; channel coding; decoding; encoding; multi-access systems; Gaussian channels; achievable rate tuples; average error probability; capacity region; coders; codeword length; decoder; discrete memoryless multiaccess channel; multirate achievability; necessary condition; sufficient condition; vector rate tuple; Capacity planning; Decoding; Error probability; Gaussian channels; Random variables;
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
DOI :
10.1109/ISIT.1994.394912
