Advertisement

A Survey of Coding Methods for the Adder Channel

  • Gurgen H. Khachatrian
Chapter

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.

Keywords

Difference Matrix Code Construction Decodable Code Code Pair Adder Channel 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    R. Ahlswede, “Multi-way communication channels”, Proc. 2nd Int. Symp. Inform. Theory, Thakhkadzor, Armenia, 1971, 23–25.Google Scholar
  2. [2]
    T. Kasami and S. Lin, “Coding for a multiple-access channel”, IEEE Trans. Inform. Theory, 1976, 129–137.Google Scholar
  3. [3]
    E. J. Weldon, “Coding for a multiple-access channel”, Information and Control, 1978, 256–274.Google Scholar
  4. [4]
    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.Google Scholar
  5. [5]
    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.Google Scholar
  6. [6]
    H. van Tilborg, “An upper bound for codes in a two-access binaryerasure channel”, IEEE Trans. Inform. Theory, 1978, 112–116.Google Scholar
  7. [7]
    C. E. Shannon, “Two-way communication channels”, Proc. of 4th Berkley Symp. Math. Stat. Prob., Vol. N1, 611–644, 1961.MathSciNetGoogle Scholar
  8. [8]
    G. Khachatrian, “Construction of uniquely decodable code pairs for two-user noiseless adder channel”, Problemi Peredachi Informasi, 1981.Google Scholar
  9. [9]
    G. Khachatrian, “On the construction of codes for noiseless synchronized 2-user channel”, Problems of Control and Inform. Theory, 1982, 319–324.Google Scholar
  10. [10]
    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.MATHGoogle Scholar
  11. [11]
    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.MathSciNetMATHCrossRefGoogle Scholar
  12. [12]
    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.Google Scholar
  13. [13]
    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.Google Scholar
  14. [14]
    M. L. Ulrey, “The capacity region of a channel with s senders and r receivers”, Information and Control 29, 1975, 185–203.MathSciNetMATHCrossRefGoogle Scholar
  15. [15]
    H. J. Liao, Multiple-Access Channels, PHD Dissertation, Dept. of Elect. Eng. University of Hawaii, 1972.Google Scholar
  16. [16]
    S. C. Chang and E. J. Weldon, “Coding for t-user multiple-cccess channels”, IEEE Trans. on Inform. Theory, 1979, 684–691.Google Scholar
  17. [17]
    T. Ferguson, “Generalized T-user codes for multiple-access channels”, IEEE Trans. Inform. Theory 28, 1982, 775–778.MATHCrossRefGoogle Scholar
  18. [18]
    S. C. Chang, “Further results on coding for T-user multiple-access channels”, IEEE Trans. Inform. Theory 30, 1984, 411–415.MathSciNetMATHCrossRefGoogle Scholar
  19. [19]
    S. S. Martirossian, “Codes for noiseless adder channel”, X Prague Conference on Inform. Theory, Abstracts of papers, Prague, 1986, 110–111.Google Scholar
  20. [20]
    G. Khachatrian, S. S. Martirossian, “Code construction for the T-user noiseless adder channel”, IEEE Trans. Inform. Theory 44, 1998, 1953–1957.MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2000

Authors and Affiliations

  • Gurgen H. Khachatrian
    • 1
  1. 1.Institute for Problems of Informatics and AutomationArmenian National Academy of SciencesYerevanArmenia

Personalised recommendations