Further results on coding for T-user multiple-access channels (Corresp.)

Shih-Chun Chang

IEEE Transactions on Information Theory · 1984 · 35 citations · 2 references

Concepts

Abstract

Coding schemes for the noiseless <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">T</tex> -user binary adder multiple-access channel are discussed. A class of uniquely decodable codes of arbitrary length satisfying a specific recursive relationship and which are asymptotically good is explicitly constructed.

References

2