Two-dimensional constrained coding based on tiling

IEEE Transactions on Information Theory

Volumn 56, Issue 4, 2010, Pages 1800-1807

  Sharov, Artyom ^a   Roth, Ron M ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Markov chain; No isolated bits (n.i.b.) constraint; Pickard random fields; Runlength limited (RLL) constraints; Tiling; Two dimensional (2 D) constraints; Variable rate codes

Indexed keywords

CODING TECHNIQUES; CONSTRAINED CODING; LOWER BOUNDS; MARKOV CHAIN; RANDOM FIELDS; RUN LENGTH LIMITEDS; VARIABLE RATE;

MARKOV PROCESSES;

TWO DIMENSIONAL;

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

References (23)

1. K. A. S. Immink, Codes for Mass Data Storage Systems. Eindhoven, The Netherlands: Shannon Foundation, 2004.
2. Information Technology-Automatic Identification and Data Capture Techniques-Bar Code Symbology Specifications-PDF417, ISO/IEC 15438:2001.
3. Y. P.Wang, "System for encoding and decoding data in machine readable graphic form," U.S. Patent 5 243 655, 1993.
4. B. H. Marcus, R. M. Roth, and P. H. Siegel, "Constrained systems and coding for recording channels," in Handbook of Coding Theory, V. S. Pless and W. C. Huffman, Eds. Amsterdam, The Netherlands: Elsevier Scientific, 1998.
5. R. Berger, "The undecidability of the domino problem," in Memoirs of the American Mathematical Society. Providence, RI: AMS, 1966, vol.66.
6. R. M. Robinson, "Undecidability and nonperiodicity for tilings of the plane," Inventiones Math., vol.12, pp. 177-209, 1971.
7. A. Kato and K. Zeger, "On the capacity of two-dimensional run-length constrained channels," IEEE Trans. Inf. Theory, vol.45, no.5, pp. 1527-1540, Jul. 1999.
8. S. Forchhammer and T. V. Laursen, "A model for the two-dimensional No Isolated Bits constraint," in Proc. IEEE Symp. Inf. Theory, Seattle, WA, 2006, pp. 1189-1193.
9. S. Forchhammer and T. V. Laursen, "Entropy of bit-stuffing-induced measures for two-dimensional checkerboard constraints," IEEE Trans. Inf. Theory, vol.53, no.4, pp. 1537-1546, Apr. 2007.
10. R. M. Roth, P. H. Siegel, and J. K. Wolf, "Efficient coding schemes for the hard-square model," IEEE Trans. Inf. Theory, vol.47, no.3, pp. 1166-1176, Mar. 2001.
11. I. Tal and R. M. Roth, "Bounds on the rate of 2-D bit-stuffing encoders," in Proc. IEEE Symp. Inf. Theory, Toronto, ON, Canada, 2008, pp. 1463-1467.
12. E. Ordentlich and R. M. Roth, "Capacity lower bounds and approximate enumerative coding for 2-D constraints," in Proc. IEEE Symp. Inf. Theory, Nice, France, 2007, pp. 1681-1685.
13. J. J. Ashley and B. H. Marcus, "Two-dimensional low-pass filtering codes," IEEE Trans. Commun., vol.46, no.6, pp. 724-727, Jun. 1998.
14. Z. Nagy and K. Zeger, "Bit-stuffing bounds and analysis for run-length constrained channels in two and three dimensions," IEEE Trans. Inf. Theory, vol.50, no.12, pp. 3146-3169, Dec. 2004.
15. E. Louidor and B. H. Marcus, "Improved lower bounds on capacities of symmetric 2-dimensional constraints using Rayleigh quotients," in Proc. IEEE Symp. Inf. Theory, Seoul, Korea, 2009, pp. 1045-1049.
16. N. J. Calkin and H. S. Wilf, "The number of independent sets in a grid graph," SIAM J. Discrete Math., vol.11, pp. 54-60, 1998.
17. W. Weeks, IV and R. E. Blahut, "The capacity and coding gain of certain checkerboard codes," IEEE Trans. Inf. Theory, vol.44, no.3, pp. 1193-1203, May 1998.
18. D. K. Pickard, "Unilateral Markov fields," Adv. Appl. Prob., vol.12, pp. 655-671, 1980.
19. F. Champagnat, J. Idier, and Y. Goussard, "Stationary Markov random fields on a finite rectangular lattice," IEEE Trans. Inf. Theory, vol.44, no.7, pp. 2901-2916, Nov. 1998.
20. Z. Nagy and K. Zeger, "Capacity bounds for the 3-dimensional (0, 1) runlength limited channel," IEEE Trans. Inf. Theory, vol.46, no.3, pp. 1030-1033, May 2000.
21. J. Idier and Y. Goussard, Champs de Pickard Tridimensionnels, Université de Montréal etÉcole Polytechnique, Institut de génie biomédical, Montréal, QC, Canada, Tech. Rep. IGB/L2S, 1999.
22. E. Ordentlich and R. M. Roth, "Independent sets in regular hypergraphs and multi-dimensional runlength-limited constraints," SIAM J. Discrete Math., vol.17, pp. 615-623, 2004.
23. A. A. Sapozhenko, "The number of antichains in ranked posets," Discrete Math. Appl., vol.1, pp. 35-58, 1991.