Advertisement

Constructive Codes for Multi-User Communication Channels

  • Jack Keil Wolf
Part of the International Centre for Mechanical Sciences book series (CISM, volume 219)

Abstract

In these notes several constructive coding schemes are presented for specific multi-user communication channels. Both the multi-access channel and the broadcast channel will be considered.

Keywords

Capacity Region Code Word Generator Polynomial Broadcast Channel Transmitted Vector 
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.
    Liao, H., “Multiple access channels” Ph.D. Dissertation, Dept. of Electrical Engrg., Univ. of Hawaii, Honolulu, Hawaii, 1972.Google Scholar
  2. 2.
    Slepian, B. and Wolf, J.K., “A coding theorem for multiple access channels with correlated sources,” Bell Systems Technical Journal, vol. 52, 1037, September 1973.CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    Ahlswede, “Multi-way communications channels” presented at 2nd International Symposium on Information Transmissions, USSR, 1971.Google Scholar
  4. 4.
    Van der Meulen, E.C., “The discrete memoryless channel with two senders and one receiver,” presented at 2nd International Symposium on Information Transmission, USSR, 1971.Google Scholar
  5. 5.
    Ulrey, M.L., “Sequential coding for channels with feedback and a coding theorem for a channel with several senders and receivers,” Ph.D. Dissertation, Dept. of Mathematics, Ohio State Univ., 1973.Google Scholar
  6. 6.
    Gaarder, N.T. and Wolf, J.K., “The capacity region of a multiple-access discrete memoryless channel can increase with feedback,” IEEE Transactions on Information Theory, vol. IT-21, 100, January 1975.Google Scholar
  7. 7.
    Kasami, T. and Lin, S., “Coding for a multiple access channel,” submitted to IEEE Transactions on Information Theory.Google Scholar
  8. 8.
    Lin, S., private communication.Google Scholar
  9. 9.
    Wolf, J.K., “Multiple user communications,” National Telemetry Conference, Atlanta, Georgia, 1973.Google Scholar
  10. 10.
    Cover, T., “Broadcast Theory, vol. IT-18, 2Google Scholar
  11. 11.
    Bergmans, P., “Random degraded components,” vol. IT-19, 197, March channels,“ IEEE Transactions on Information January 1972. coding theorems for broadcast channels with IEEE Transactions on Information Theory, 1973. References (continued)Google Scholar
  12. 12.
    Wyner, A., “A theorem on the entropy of certain binary sequences and applications; Part II,” IEEE Transactions on Information Theory, vol. IT-19, 772, November 1973.Google Scholar
  13. 13.
    Gallager, R.G., “Coding for degraded broadcast channels,” to appear in Prob. Peradachi Informatsi.Google Scholar
  14. 14.
    Cover, T., “An achievable rate region for the broadcast channel,” IEEE Transactions on Information Theory, vol. IT-21, 399, July 1975.Google Scholar
  15. 15.
    Slepian, D., “Permutation modulation,”Proc. of the IEEE, 228, March 1965.Google Scholar

Copyright information

© Springer-Verlag Wien 1975

Authors and Affiliations

  • Jack Keil Wolf
    • 1
  1. 1.Department of Electrical and Computer EngineeringUniversity of MassachusettsAmherstUSA

Personalised recommendations