Abstract
In this survey the main results on coding for the noiseless multi-user adder channel are presented. The survey consists of two parts, where the coding methods for the 2-user adder channel and T-user adder channel are given respectively.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Ahlswede, “Multi-way communication channels”, Proc. 2nd Int. Symp. Inform. Theory, Thakhkadzor, Armenia, 1971, 23–25.
T. Kasami and S. Lin, “Coding for a multiple-access channel”, IEEE Trans. Inform. Theory, 1976, 129–137.
E. J. Weldon, “Coding for a multiple-access channel”, Information and Control, 1978, 256–274.
T. Kasami and S. Lin, “Bounds on the achievable rates of block coding for a memoryless multiple-access channel”, IEEE Trans. Inform. Theory, 1978, 186–187.
T. Kasami, S. Lin, V.Wei and S. Yamamura, “Graph theoretic approach to the code construction of the two-user multiple-access binary adder channel”, IEEE Trans. Inform. Theory, 1983, 114–130.
H. van Tilborg, “An upper bound for codes in a two-access binaryerasure channel”, IEEE Trans. Inform. Theory, 1978, 112–116.
C. E. Shannon, “Two-way communication channels”, Proc. of 4th Berkley Symp. Math. Stat. Prob., Vol. N1, 611–644, 1961.
G. Khachatrian, “Construction of uniquely decodable code pairs for two-user noiseless adder channel”, Problemi Peredachi Informasi, 1981.
G. Khachatrian, “On the construction of codes for noiseless synchronized 2-user channel”, Problems of Control and Inform. Theory, 1982, 319–324.
G. Khachatrian and H. Shamoyan, “The cardinality of uniquely decodable codes for two-user adder channel”, J. Inform. Process. Cybernet, EIK 27, 7, 1991, 351–355.
P. Coebergh van den Braak and H. van Tilborg, “A family of good uniquely decodable code pairs for the two-access binary adder channel”, IEEE Trans. Inform. Theory 31, 1985, 3–9.
R. Ahlswede and V. B. Balakirsky, “Construction of uniquely decodable codes for the two-user binary adder channel”, Proc. 2nd INTAS Meeting on Inform. Theory and Combinatorics, Essen, Germany, 1997, 1–2.
G. Khachatrian, “New construction of uniquely decodable codes for two-user adder channel”, Colloquim dedicated to the 70-anniversary of prof. R. Varshamov, Thakhkadzor, Armenia, October 1–7, 1997.
M. L. Ulrey, “The capacity region of a channel with s senders and r receivers”, Information and Control 29, 1975, 185–203.
H. J. Liao, Multiple-Access Channels, PHD Dissertation, Dept. of Elect. Eng. University of Hawaii, 1972.
S. C. Chang and E. J. Weldon, “Coding for t-user multiple-cccess channels”, IEEE Trans. on Inform. Theory, 1979, 684–691.
T. Ferguson, “Generalized T-user codes for multiple-access channels”, IEEE Trans. Inform. Theory 28, 1982, 775–778.
S. C. Chang, “Further results on coding for T-user multiple-access channels”, IEEE Trans. Inform. Theory 30, 1984, 411–415.
S. S. Martirossian, “Codes for noiseless adder channel”, X Prague Conference on Inform. Theory, Abstracts of papers, Prague, 1986, 110–111.
G. Khachatrian, S. S. Martirossian, “Code construction for the T-user noiseless adder channel”, IEEE Trans. Inform. Theory 44, 1998, 1953–1957.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Additional information
Dedicated to Rudolf Ahlswede on the occasion of his 60th birthday
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Khachatrian, G.H. (2000). A Survey of Coding Methods for the Adder Channel. In: Althöfer, I., et al. Numbers, Information and Complexity. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6048-4_17
Download citation
DOI: https://doi.org/10.1007/978-1-4757-6048-4_17
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4967-7
Online ISBN: 978-1-4757-6048-4
eBook Packages: Springer Book Archive