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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Kato and K. Zeger, “On the Capacity of Two-Dimensional Run Length Constrained Channels, ” IEEE Trans. Info. Theory, 1999 (to appear).
D. Lind and B. H. Marcus, An Introduction to Symbolic Dynamics and Coding. New York: Cambridge University Press, 1995.
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.
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.
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.
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.
R. B. Bapat and T. E. S. Raghavan, Nonnegative Matrices and Applications. Cambridge, United Kingdom: Cambridge University Press, 1997.
G. H. Golub and C. F. van Loan, Matrix Computations (3rd edition). Baltimore and London: Johns Hopkins University Press, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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