Skip to main content
SpringerLink
Log in

Capacity Bounds for the 3-Dimensional (0, 1) Runlength Limited Channel

  • Conference paper
  • First Online:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1719))

Abstract

The capacity C (3)0,1 of a 3-dimensional (0, 1) runlength constrained channel is shown to satisfy 0.522501741838 ≤ C (3)0,1 ≤ 0.526880847825.

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. A. Kato and K. Zeger, “On the Capacity of Two-Dimensional Run Length Constrained Channels, ” IEEE Trans. Info. Theory, 1999 (to appear).

    Google Scholar 

  2. D. Lind and B. H. Marcus, An Introduction to Symbolic Dynamics and Coding. New York: Cambridge University Press, 1995.

    MATH  Google Scholar 

  3. N. J. Calkin and H. S. Wilf, “The Number of Independent Sets in a Grid Graph,” SIAM Journal on Discrete Mathematics, vol. 11, pp. 54–60, February 1998.

    Article  MATH  MathSciNet  Google Scholar 

  4. W. Weeks and R. E. Blahut, “The Capacity and Coding Gain of Certain Checkerboard Codes, ” IEEE Trans. Info. Theory, vol. 44, pp. 1193–1203, May 1998.

    Article  MATH  MathSciNet  Google Scholar 

  5. P. H. Siegel and J. K. Wolf, “Bit Stuffing Bounds on the Capacity of 2-Dimensional Constrained Arrays, ” in Proceedings of ISIT98, (MIT, Cambridge, MA), p. 323, August 1998.

    Google Scholar 

  6. K. A. Immink, O. H. Siegel, and J. K. Wolf, “Codes for Digital Recorders,” IEEE Trans. Info. Theory, vol. 44, pp. 2260–2299, October 1998.

    Article  MATH  MathSciNet  Google Scholar 

  7. R. B. Bapat and T. E. S. Raghavan, Nonnegative Matrices and Applications. Cambridge, United Kingdom: Cambridge University Press, 1997.

    MATH  Google Scholar 

  8. G. H. Golub and C. F. van Loan, Matrix Computations (3rd edition). Baltimore and London: Johns Hopkins University Press, 1996.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA, 92093-0407

    Zsigmond Nagy & Kenneth Zeger

Authors
  1. Zsigmond Nagy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kenneth Zeger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering, University of Hawaii, 2540 Dole St., # 483, Honolulu, HI, 96822, USA

    Marc Fossorier  & Shu Lin  & 

  2. Institute of Industrial Science, University of Tokyo, 7-22-1, Roppongi, Minato-ku, Tokyo, 106, Japan

    Hideki Imai

  3. AAECC/IRIT, Université Paul Sabatier, 118, Route de Narbonne, F31067, Toulouse, Cedex, France

    Alain Poli

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nagy, Z., Zeger, K. (1999). Capacity Bounds for the 3-Dimensional (0, 1) Runlength Limited Channel. In: Fossorier, M., Imai, H., Lin, S., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1999. Lecture Notes in Computer Science, vol 1719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46796-3_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-46796-3_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66723-0

  • Online ISBN: 978-3-540-46796-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation