DocumentCode :
935250
Title :
Generalized T-user codes for multiple-access channels (Corresp.)
Author :
Ferguson, T.
Volume :
28
Issue :
5
fYear :
1982
fDate :
9/1/1982 12:00:00 AM
Firstpage :
775
Lastpage :
778
Abstract :
Large classes of 
-user codes for the binary adder channel are shown to be easily constructed by generalizing some previous results in two basic ways. The first is an iterative procedure; the second is by introducing an equivalence relation on such codes. Decoding algorithms are presented in both cases. The number of codes in the equivalence class of some previously defined codes is determined exactly.
-user codes for the binary adder channel are shown to be easily constructed by generalizing some previous results in two basic ways. The first is an iterative procedure; the second is by introducing an equivalence relation on such codes. Decoding algorithms are presented in both cases. The number of codes in the equivalence class of some previously defined codes is determined exactly.Keywords :
Multiple-access communications; Block codes; Communication systems; Iterative algorithms; Iterative decoding; Welding;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1982.1056549
Filename :
1056549
Link To Document :
