Skip to main content
SpringerLink
Log in
Book cover

Performance Limits in Communication Theory and Practice pp 403–426Cite as

Capacity Limits for Multiple-Access Channels without Feedback

  • Chapter

  • 238 Accesses

Part of the book series: NATO ASI Series ((NSSE,volume 142))

Abstract

In this paper several results on the multiple-access channel, which have been obtained by various researchers in information theory around the world during the past decade, are described. The word “multiple-access channel” is to be interpreted here solely from the point of view of multi-user information theory, i.e., in the Shannon-theoretic sense. The recent results are presented through a series of coding theorems and converses, with the emphasis on the statement and interpretation of these results, rather than on proofs. In a previous survey [41] the research advances of several multi-way channels, including the multiple-access channel, were described for the period 1961-July 1976. The present survey describes research progress on the multiple-access channel since then. However, space limitations have compelled the author to restrict himself to certain topics. Another survey [42], describing the results on the broadcast channel during the period 1976–1980, appeared in the Proceedings of a previous NATO Advanced Study Institute.

The research for this paper was supported in part by Onderzoeksfonds, Katholieke Universiteit Leuven, Project OT/VI/17-OT/IX/20, and by Project GOA 83/88–53, Ministerie van Wetenschapsbeleid, Brussels. Belgium.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Ahlswede, “Multi-way communication channels,” in Proc. 2nd Int. Symp. Inform. Theory, Tsahkadsor, 1971. Publishing House of the Hungarian Academy of Sciences, pp. 23–52, 1973.

    Google Scholar 

  2. R. Ahlswede, “The capacity region of a channel with two senders and two receivers,” Ann. Prob., vol. 2, pp. 805–814, Oct. 1974.

    Article  MathSciNet  MATH  Google Scholar 

  3. R. Ahlswede, “An elementary proof of the strong converse theorem for the multiple-access channel,” J. of Combinatorics, Information & System Sciences, vol. 7, no. 3, 216–230, 1982.

    MathSciNet  MATH  Google Scholar 

  4. R. Ahlswede and G. Dueck, “Good codes can be produced by a few permutations,” IEEE Trans. Inform. Theory, vol. IT-28, no. 3, pp. 430–443, May 1982.

    Article  MathSciNet  Google Scholar 

  5. R. Ahlswede and T.S. Han, “On source Goding with side information via a multiple-access channel and related problems in multi-user information theory,” IEEE Trans. Inform. Theory, vol. IT-29, no. 3, pp. 396–412, May 1983.

    Article  MathSciNet  Google Scholar 

  6. L.A. Bassalygo, M.S. Pinsker and V.V. Prelov, “Zero-error capacity for deterministic multiple-access channels with common information,” Probl. Pered. Inform., vol. 18, no. 1, pp. 3–11, Jan.-March 1982.

    MathSciNet  Google Scholar 

  7. M. Bierbaum and H.M. Wallmeier, “A note on the capacity region of the multiple-access channel,” IEEE Trans. Inform. Theory, vol. IT-25, p. 484, July 1979.

    Article  Google Scholar 

  8. T. Cover, “Some advances in broadcast channels,” in Advances in Communication Systems, Vol. 4, A. Viterbi, Ed. San Francisco: Academic Press, 1975.

    Google Scholar 

  9. T.M. Cover, A. El Gamal, and M. Salehi, “Multiple access channels with arbitrarily correlated sources,” IEEE Trans. Inform. Theory, vol. IT-26, pp. 648–657, Nov. 1980.

    Article  Google Scholar 

  10. T.M. Cover, R.J. McEliece, and E.G. Posner, “Asynchronous multiple-access channel capacity,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 409–413, July 1981.

    Article  MathSciNet  Google Scholar 

  11. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic Press, 1981.

    MATH  Google Scholar 

  12. M.A. Deaett and J.K. Wolf, “Some very simple codes for the nonsynchronized two-user multiple-access adder channel with binary inputs,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 634–635, Sept. 1978.

    Google Scholar 

  13. K. De Bruyn, V.V. Prelov, and E.C. van der Meulen, “Reliable transmission of two correlated sources over an asymmetric multiple-access channel”. Accepted for. publication in IEEE Trans. Inform. Theory.

    Google Scholar 

  14. K. De Bruyn and E.C. van der Meulen, “An iterative code construction and codes generated by permutations for the asymmetric multiple-access channel,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 607–617, July 1986.

    Google Scholar 

  15. G. Dueck, “Maximal error capacity regions are smaller than average error capacity regions for multi-user channels,” Probl. of Control and Inform. Theory, vol. 7, pp. 11–19, 1978.

    MathSciNet  MATH  Google Scholar 

  16. G. Dueck, “A note on the multiple access channel with correlated sources,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 232–235, March 1981.

    Article  MathSciNet  Google Scholar 

  17. G. Dueck, “The strong converse of the coding theorem for the multiple-access channel”, J. of Combinatorics, Information & System Sciences, vol. 6, no. 3, pp. 187–196, 1981.

    MathSciNet  MATH  Google Scholar 

  18. A. El Gamal and T.M. Cover, “Multiple user information theory,” Proc. IEEE, vol. 68, pp. 1466–1483, Dec. 1980.

    Article  Google Scholar 

  19. P. Gács and J. Körner, “Common information is far less than mutual information,” Probl. of Control and Inform. Theory, vol. 2, pp. 149–162, 1973.

    MATH  Google Scholar 

  20. R.G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.

    MATH  Google Scholar 

  21. R.G. Gallager, “A perspective on multiaccess channels,” IEEE Trans. Inform. Theory, vol. IT-31, pp. 124–142, Mar. 1985.

    Article  MathSciNet  Google Scholar 

  22. A.A. Grigor’ev, “Boundary of region of permissible rates for asynchronous communication over a binary summing channel,” Probl. Pered. Inform., vol. 15, no. 3, pp. 18–23, July-September, 1979.

    MathSciNet  Google Scholar 

  23. T.S. Han, “The capacity region of a general multiple-access channel with certain correlated sources,” Inform. Control, vol. 40, pp. 37–60, 1979.

    Article  MATH  Google Scholar 

  24. E.A. Haroutunian, “Lower bounds for the error probability of multiple access channels,” Probl. Pered. Inform., vol. 11, no. 2, pp. 23–36, April-June, 1975.

    Google Scholar 

  25. J.Y.N. Hui and P.A. Humblet, “The capacity region of the totally asynchronous multiple access channel,” IEEE Trans. In form. Theory, vol. IT-31, pp. 207–216, Mar. 1985.

    Article  Google Scholar 

  26. T. Kasami, S. Lin, V.K. Wei, and S. Yamamura, “Graph theoretic approaches to the code construction for the two-user multiple-access binary adder channel,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 114–130, Jan. 1983.

    Article  MathSciNet  Google Scholar 

  27. C. Keilers, “The capacity of the spectral Gaussian multiple-access channel,” Ph. D. dissertation, Dept. of Electrical Engineering, Stanford University, Stanford, CA, April 1976.

    Google Scholar 

  28. H. Liao, “A coding theorem for multiple access communications,” presented at Int. Symp. on Inform. Theory, Asilomar, 1972. Also Ph. D. dissertation, “Multiple Access Channels,” Dept. of Elec. Eng., Univ. of Hawaii, 1972.

    Google Scholar 

  29. J. Pokorny and H.M. Wallmeier, “Random coding bound and codes produced by permutations for the multiple-access channel,” IEEE Trans. Inform. Theory, vol. IT-31, pp. 741–750, Nov. 1985.

    Article  MathSciNet  Google Scholar 

  30. G. Sh. Poltyrev, “Coding in an asynchronous multiple-access channel,” Probl. Pered. Inform., vol. 19, no. 3, pp. 12–21, July-Sept., 1983.

    MathSciNet  Google Scholar 

  31. V.V. Prelov, “Transmission over a multiple-access channel with a special source hierarchy,” Probl. Pered. Inform., vol. 20, no. 4, pp. 3–10, October-December, 1984.

    MathSciNet  Google Scholar 

  32. M. Salehi, “Cardinality bounds on auxiliary variables in multiple-user theory via the method of Ahlswede and Körner,” Dept. of Statistics, Stanford University, Stanford, CA, Tech. Rep. 33, August 1978.

    Google Scholar 

  33. C.E. Shannon, “A mathematical theory of communication,” Bell Syst. Tech. J., vol. 27, pp. 379–423 (Part I), pp. 623–656 (Part II), July and October 1948. Reprinted in Key Papers in the Development of Information Theory, D. Slepian, Ed. New York: IEEE, 1974, pp. 5–29.

    Google Scholar 

  34. C.E. Shannon, “Communication in the presence of noise,” in Proc. IRE, vol. 37, pp. 10–21, Jan. 1949. Reprinted in Key Papers in the Development of Information Theory, D. Slepian, Ed. New York: IEEE, 1974, pp. 30–41.

    Google Scholar 

  35. C.E. Shannon, “Two-way communication channels,” in Proc. 4th Berkeley Symp. Math. Stat. Prob., vol. 1, pp. 611–644, 1961. Reprinted in Key Papers in the Development of Information Theory, D. Slepian, Ed. New York: IEEE Press, 1974, pp. 339–372.

    Google Scholar 

  36. D. Slepian and J.K. Wolf, “Noiseless coding of correlated information sources,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 471–480, July 1973. Reprinted in Key Papers in the Development of Information Theory, D. Slepian, Ed. New York: IEEE, -1974/ pp. 450–459.

    Article  MathSciNet  Google Scholar 

  37. D. Slepian and J.K. Wolf, “A coding theorem for multiple access channels with correlated sources,” Bell Syst. Tech. J., vol. 52, pp. 1037–1076, Sept. 1973.

    MathSciNet  MATH  Google Scholar 

  38. M.L. Ulrey, “The capacity region of a channel with s senders and r receivers,” Inform. Contr., vol. 29, pp. 185–203, 1975.

    Article  MathSciNet  MATH  Google Scholar 

  39. E.C. van der Meulen, “The discrete memoryless channel with two senders and one receiver,” in Proc. 2nd Int. Symp. Inform. Theory, Tsahkadsor, 1971. Publishing House of the Hungarian Academy of Sciences, pp. 103–135, 1973.

    Google Scholar 

  40. E.C. van der Meulen, “On a problem by Ahlswede regarding the capacity region of certain multi-way channels,” Inform. Contr., vol. 25, pp. 351–356, 1974.

    Article  MATH  Google Scholar 

  41. E.C. van der Meulen, “A survey of multi-way channels in information theory: 1961–1976,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 1–37, Jan. 1977.

    Article  Google Scholar 

  42. E.C. van der Meulen, “Recent coding theorems and converses for multi-way channels. Part I: the broadcast channel (1976–1980),” in New Concepts in Multi-User Communication (NATO Advanced Study Institute Series) J.K. Skwyrzinsky, Ed. Alphen aan den Rijn, The Netherlands: Sijthoff & Noordhoff International, 1981, pp. 15–51.

    Google Scholar 

  43. F.M.J. Willems, “Informationtheoretical results for the discrete memoryless multiple access channel,” Ph. D. dissertation, Dept. of Mathematics, K.U. Leuven, Leuven, Belgium, October 1982.

    Google Scholar 

  44. H.S. Witsenhausen, “On sequences of pairs of dependent random variables,” SIAM J. Appl. Math., vol. 28, pp. 100–113, Jan. 1975.

    Article  MathSciNet  MATH  Google Scholar 

  45. J. Wolfowitz, Coding Theorems of Information Theory, 3rd Ed. Berlin: Springer, 1978.

    MATH  Google Scholar 

  46. A.D. Wyner, “Recent results in the Shannon theory,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 2–10, Jan. 1974.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departement Wiskunde, Katholieke Universiteit Leuven, B-3030, Leuven, Belgium

    Edward C. van der Meulen

Authors
  1. Edward C. van der Meulen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Marconi Research Centre, Great Baddow, Chelmsford, Essex, UK

    J. K. Skwirzynski

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Kluwer Academic Publishers

About this chapter

Cite this chapter

van der Meulen, E.C. (1988). Capacity Limits for Multiple-Access Channels without Feedback. In: Skwirzynski, J.K. (eds) Performance Limits in Communication Theory and Practice. NATO ASI Series, vol 142. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-2794-0_25

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-2794-0_25

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-7757-6

  • Online ISBN: 978-94-009-2794-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation