DocumentCode :
933966
Title :
Universal coding for multiple access channels
Author :
Ohkubo, Motoaki
Volume :
27
Issue :
6
fYear :
1981
fDate :
11/1/1981 12:00:00 AM
Firstpage :
728
Lastpage :
734
Abstract :
The problems of universal coding and decoding for multiple-access channels are examined. The hypothetical mutual information functions are used to prove that rate vectors 
in a subregion 
of the capacity region 
are universally achievable in the sense that there exist codes of rate 
that are asymptotically optimum for all multiple-access channels with finite fixed input alphabets 
, and output alphabet 
.
in a subregion of the capacity region are universally achievable in the sense that there exist codes of rate that are asymptotically optimum for all multiple-access channels with finite fixed input alphabets , and output alphabet .Keywords :
Block codes; Multiple-access communications; Block codes; Channel capacity; Channel coding; Decoding; Error probability; Information analysis; Memoryless systems; Mutual information; Upper bound;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1981.1056423
Filename :
1056423
Link To Document :
