Nearly optimal multiuser codes for the binary adder channel

Author

Hughes, Brian L. ; Cooper, A. Brinton, III

Author_Institution

Dept. of Electr. & Comput. Eng., Johns Hopkins Univ., Baltimore, MD, USA

Volume

42

Issue

2

fYear

1996

fDate

3/1/1996 12:00:00 AM

Firstpage

387

Lastpage

398

Abstract

Coding schemes for the T-user binary adder channel are investigated. Recursive constructions are given for two families of mixed-rate, multiuser codes. It is shown that these basic codes can be combined by time-sharing to yield codes approaching most rates in the T-user capacity region. In particular, the best codes constructed herein achieve a sum-rate, R₁+...+R_T, which is higher than all previously reported codes for almost every T and is within 0.547-bit-per-channel use of the information-theoretic limit. Extensions to a T-user, Q-frequency adder channel are also discussed

Keywords

adders; channel coding; codes; multi-access systems; telecommunication channels; binary adder channel; information-theoretic limit; mixed-rate multiuser codes; multiple-access channel; nearly optimal multiuser codes; recursive code constructions; sum-rate; time-sharing; Channel capacity; Feedback; Galois fields; Information science; Information theory; Laboratories; Military computing; Multiaccess communication; Performance gain; Time sharing computer systems;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.485711

Filename

485711