Skip to main content
SpringerLink
Log in

A Linear Programming Bound for Codes in a 2-Access Binary Erasure Channel

  • Chapter
Book cover Multi-User Communication Systems

Part of the book series: International Centre for Mechanical Sciences ((CISM,volume 265))

  • 159 Accesses

Abstract

Two counting arguments are used to derive a system of linear inequalities which give rise to an upperbound on the size of a code for a 2-access binary erasure channel.

For uniquely decodable codes this bound reduces to a purely combinatorial proof of a result by Liao. Examples of this bound are given for some codes with minimum distance 4.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahlswede, R., “Multi-way corranunication channels”, in Proc. 2nd Int. Symp. Information Transmission, Hungarian Press, Tsahkadsor, Armenia, U.S.S.R.

    Google Scholar 

  2. Gaarder, N.T. and J.K. Wolf, “The capacity region of a multiple-access discrete memoryless channel can increase with feedback”, IEEE Trans. Inform. Theory, vol. IT-21, pp.100–102, Jan. 1975.

    Article  MATH  MathSciNet  Google Scholar 

  3. Kasami, T. and S. Lin, “Coding for a multiple-access channel”, IEEE Trans. Inform. Theory, vol. IT-22, pp.129–137, Mar. 1976.

    Article  ADS  MATH  MathSciNet  Google Scholar 

  4. Kasami, T. and S. Lin, “Bounds on the achievable rates of block coding for a memoryless multiple-access channel”, IEEE Trans. on Inform. Theory, vol. IT-24, pp.187–197, Mar. 1978.

    Article  MATH  MathSciNet  Google Scholar 

  5. Kasami, T. and S. Lin, “Decoding of 6-decodable codes for a multiple-access channel”, IEEE Trans, on Inform. Theory, vol. IT24, pp. 633–635, Sep. 1978.

    Article  MathSciNet  Google Scholar 

  6. Liao, H.H.J., “Multiple access channels”, Ph.D. Thesis, Dep. Elec. Eng., University of Hawaii, Honolulu, 1972.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Eindhoven University of Technology, Eindhoven, the Netherlands

    Henk C. A. van Tilborg

Authors
  1. Henk C. A. van Tilborg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Università di Trieste, Italy

    G. Longo

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Wien

About this chapter

Cite this chapter

van Tilborg, H.C.A. (1981). A Linear Programming Bound for Codes in a 2-Access Binary Erasure Channel. In: Longo, G. (eds) Multi-User Communication Systems. International Centre for Mechanical Sciences, vol 265. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2900-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-2900-5_8

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-81612-7

  • Online ISBN: 978-3-7091-2900-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation