Asymptotic Capacity of Two-Dimensional Channels with Checkerboard Constraints

IEEE Transactions on Information Theory

Volumn 49, Issue 9, 2003, Pages 2115-2125+2324

  Nagy, Zsigmond ^a   Zeger, Kenneth ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Asymptotics; Constrained channel coding; Optical data storage; Run length limited codes

Indexed keywords

ASYMPTOTIC STABILITY; CODES (SYMBOLS); CONSTRAINT THEORY; ENCODING (SYMBOLS);

TWO-DIMENSIONAL CHANNELS;

CHANNEL CAPACITY;

EID: 0042280599     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2003.815766     Document Type: Article

References (30)

1. J. J. Ashley and B. H. Marcus, "Two-dimensional low-pass filtering codes," IEEE Trans. Commun., vol. 46, pp. 724-727, June 1998.
2. R. J. Baxter, Exactly Solved Models in Statistical Mechanics. New York: Academic, 1982.
3. R. J. Baxter and S. K. Tsang, "Entropy of hard hexagons," J. Phys. A, vol. 13, pp. 1023-1030, 1980.
4. 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.
5. J. W. S. Cassels, An Introduction to the Geometry of Numbers. Berlin, Göttingen, Heidelberg, Germany: Springer-Verlag, 1959.
6. C. H. Dowker, "On minimum circumscribed polygons," Bull. Amer. Math. Soc., vol. 50, pp. 120-122, 1944.
7. K. Engel, "On the Fibonacci number of an m × n lattice," Fibonacci Quart., vol. 28, pp. 72-78, 1990.
8. W. H. Erxleben and M. W. Marcellin, "Error-correcting two-dimensional modulation codes," IEEE Trans. Inform. Theory, vol. 41, pp. 1116-1126, July 1995.
9. T. Etzion, "Cascading methods for runlength-limited arrays," IEEE Trans. Inform. Theory, vol. IT-43, pp. 319-324, Jan. 1997.
10. T. Etzion and K. G. Paterson, "Zero/positive capacities of two dimensional runlength constrained arrays," in Proc. 2001 IEEE Intl. Symp. Information Theory, Washington, DC, June 2001, p. 269.
11. L. Fejes Tóth, Regular Figures. New York: Pergamonn, 1964.
12. S. Forchhammer and J. Justesen, "Entropy bounds for constrained twodimensional random fields," IEEE Trans. Inform. Theory., vol. 45, pp. 118-127, Jan. 1999.
13. S. Halevy and R. Roth, "Parallel constrained coding with application to two-dimensional constraints," IEEE Trans. Inform. Theory, vol. 48, pp. 1009-1020, May 2002.
14. K. A. S. Immink, P. H. Siegel, and J. K. Wolf, "Codes for digital recorders," IEEE Trans. Inform. Theory, vol. 44, pp. 2260-2299, Oct. 1998.
15. G. S. Joyce, "On the hard-hexagon model and the theory of modular functions," Philos. Trans. Roy. Soc. London Ser. A, vol. 325, no. 1588, pp. 643-702, 1988.
16. A. Kato and K. Zeger, "On the capacity of two-dimensional run length constrained channels," IEEE Trans. Inform. Theory, vol. 45, pp. 1527-1540, July 1999.
17. P. J. Kelly and M. L. Weiss, Geometry and Convexity: A Study in Mathematical Methods. New York: Wiley, 1979.
18. M. Larsen, "The problem of the kings," Elec. J. Combin., vol. 2, paper R18, 1995. Available: [Online] http://www.combinatorics.org.
19. M. P. Richey and C. A. Tracy, "Equation of state and isothermal compressibility for the hard hexagon model in the disordered regime," J. Phys. A, vol. 20, no. 16, pp. L1121-L1126, 1987.
20. C. A. Rogers, Packing and Covering. Cambridge, U.K.: Cambridge Univ. Press, 1974.
21. R. M. Roth, P. H. Siegel, and J. K. Wolf, "Efficient coding schemes for the hard-square model," IEEE Trans. Inform. Theory, vol. 47, pp. 1166-1176, Mar. 2001.
22. P. H. Siegel and J. K. Wolf, "Bit stuffing bounds on the capacity of 2-dimensional constrained arrays," in Proc. 1998 IEEE Intl. Symp. Information Theory, Cambridge, MA, Aug. 1998, p. 323.
23. E. Soljanin, "Writing sequences on the plane," IEEE Trans. Inform. Theory, vol. 48, pp. 1344-1354, June 2002.
24. R. E. Swanson and J. K. Wolf, "A new class of two-dimensional runlength-limited recording codes," IEEE Trans. Magn., vol. 28, pp. 3407-3416, Nov. 1992.
25. R. Talyansky, T. Etzion, and R. M. Roth, "Efficient code construction for certain two-dimensional constraints," IEEE Trans. Inform. Theory, vol. 45, pp. 794-799, Mar. 1999.
26. C. A. Tracy, L. Grove, and M. F. Newman, "Modular properties of the hard-hexagon model," J. Statist. Phys., vol. 48, no. 3-4, pp. 477-502, 1987.
27. 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.
28. B. V. Vasic, S. W. McLaughlin, and O. Milenkovic, "Shannon capacity of mary redundant multitrack runlength limited codes," IEEE Trans. Inform. Theory, vol. 44, pp. 766-774, Mar. 1998.
29. W. Weeks and R. E. Blahut, "The capacity and coding gain of certain checkerboard codes," IEEE Trans. Inform. Theory, vol. 44, pp. 1193-1203, May 1998.
30. H. S. Wilf, "The problem of the kings," Elec. J. Combin., vol. 2, paper R3, 1995. Available: [Online] http://www.combinatorics.org.