On the capacity of two-dimensional run-length constrained channels

IEEE Transactions on Information Theory

Volumn 45, Issue 5, 1999, Pages 1527-1540

  Kato, Akiko ^a,b   Zeger, Kenneth ^a,c  

^a IEEE

^b UNIVERSITY OF TOKYO   (Japan)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY CODES; CONSTRAINT THEORY; OPTICAL DATA STORAGE; SIGNAL ENCODING;

RUN LENGTH CODING; TWO DIMENSIONAL CODES;

CHANNEL CAPACITY;

EID: 0032640330     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.771152     Document Type: Article

References (23)

1. J. J. Ashley and P. H. Siegel, "A note on the Shannon capacity of run-length-limited codes," IEEE Trans. Inform. Theory, vol. IT-33, pp. 601-605, July 1987.
2. J. J. Ashley and B. H. Marcus, "Two-dimensional lowpass filtering codes," IBM Res. Div., Almaden Res. Ctr., IBM Res. Rep. RJ 10045 (90541), Oct. 1996.
3. N. J. Calkin and H. S. Wilf, "The number of independent sets in a grid graph," SIAM J. Discr. Math., vol. 11, pp. 54-60, Feb. 1998.
4. W. H. Erxleben and M. W. Marcellin, "Error-correcting two-dimensional modulation codes," IEEE Trans. Inform. Theory, vol. 41, pp. 1116-1126, July 1995.
5. T. Etzion, "Cascading methods for runlength-limited arrays," IEEE Trans. Inform. Theory, vol. 43, pp. 319-324, Jan. 1997.
6. W. Feller, An Introduction to Probability Theory and its Applications, vol. 1, 3rd ed. New York: Wiley, 1968, p. 54.
7. J. Justesen and Y. M. Shtarkov, "The combinatorial entropy of images," preprint.
8. D. Lind and B. H. Marcus, An Introduction to Symbolic Dynamics and Coding. New York: Cambridge Univ. Press, 1995.
9. M. W. Marcellin and H. J. Weber, "Two-dimensional modulation codes," IEEE J. Select. Areas Commun., vol. 10, pp. 254-266, Jan. 1992.
10. B. H. Marcus, P. H. Siegel, and J. K. Wolf, "Finite-state modulation codes for data storage," IEEE J. Select. Areas Commun., vol. 10, pp. 5-37, Jan. 1992.
11. v symbolic dynamics," Proc. London Math. Soc., vol. 43, no. 3, pp. 251-272, 1981.
12. v Subshifts of Finite Type. (Classical Mechanics and Dynamical Systems, Dekker Notes in Mathematics, vol. 70, R. Devaney and Z. Nitecki, Eds.) New York: Marcel Dekker, 1981, pp. 135-157.
13. S. W. McLaughlin, "The construction of M-ary (d, ∞) codes that achieve capacity and have the fewest number of encoder states," IEEE Trans. Inform. Theory, vol. 43, pp. 699-703, Mar. 1997.
14. S. W. McLaughlin, J. Luo, and Q. Xie, "On the capacity of M-ary runlength-limited codes," IEEE Trans. Inform. Theory, vol. 41, pp. 1508-1511, Sept. 1995.
15. E. K. Orcutt and M. W. Marcellin, "Redundant multitrack (d, k) codes," IEEE Trans. Inform. Theory, vol. 39, pp. 1744-1750, Sept. 1993.
16. P. N. Perry, "Runlength-limited codes for single error detection in the magnetic recording channel," IEEE Trans. Inform. Theory, vol. 41, pp. 809-815, May 1995.
17. P. H. Siegel, "Problems in coding for multi-dimensional storage devices," in IEEE Information Theory Workshop (Longyearbyen, Norway, June 1997).
18. P. H. Siegel and J. K. Wolf, "Bit stuffing bounds on the capacity of 2-dimensional constrained arrays," in Proc. IEEE Int. Symp. Information Theory (Boston, MA, Aug. 1998), p. 323.
19. R. Talyansky, Coding for Two-Dimensional Constraints, M.Sc. thesis, Computer Science Dep., Technion-Israel Inst. Technol., Haifa, Israel, 1997 (in Hebrew).
20. R. Talyansky, T. Etzion, and R. M. Roth, "Efficient code constructions for certain two-dimensional constraints," in Proc. IEEE Int. Symp. Information Theory (Ulm, Germany, June 1997), p. 387.
21. _, "Efficient code constructions for certain two-dimensional constraints," IEEE Trans. Inform. Theory, vol. 45, pp. 794-799, Mar. 1999.
22. B. V. Vasic, "Capacity of channels with redundant multitrack (d, k) constraints: The k < d case," IEEE Trans. Inform. Theory, vol. 42, pp. 1546-1548, Sept. 1996.
23. W. Weeks, IV and R. E. Blahut, "The capacity and coding gain of certain checkerboard codes," IEEE Trans. Inform. Theory, vol. 44, pp. 1193-1203, May 1998.