Improved bit-stuffing bounds on two-dimensional constraints

IEEE Transactions on Information Theory

Volumn 50, Issue 5, 2004, Pages 824-838

  Halevy, Shirley ^a   Chen, Jiangxin ^b   Roth, Ron M ^a   Siegel, Paul H ^b   Wolf, Jack Keil ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Bit stuffing encoder; Hexagonal constraint; Runlength limited (RLL) constraints; Two dimensional (2 D) constraints

Indexed keywords

BINARY SEQUENCES; BIT ERROR RATE; CHANNEL CAPACITY; COMPUTER SIMULATION; CONSTRAINT THEORY; DATA RECORDING; DATA STORAGE EQUIPMENT; MATHEMATICAL TRANSFORMATIONS;

BIT STUFFING ENCODER; HEXAGONAL CONSTRAINTS; RUNLENGTH-LIMITED CONSTRAINTS; TWO DIMENSIONAL CONSTRAINTS;

ENCODING (SYMBOLS);

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

References (34)

1. R. J. Baxter, "Hard hexagons: Exact solution," J. Phys. A, vol. 13, pp. 61-70, 1980.
2. J. J. Ashley and B. H. Marcus, "Two-dimensional low-pass filtering codes," IEEE Trans. Commun., vol. 46, pp. 724-727, June 1998.
3. P. Bender and J. K. Wolf, "A universal algorithm for generating optimal and nearly optimal run-length-limited, charge constrained binary sequences," in Proc. 1993 IEEE Int. Symp. Information Theory, San Antonio, TX, 1997, p. 6.
4. R. Berger, "The undecidability of the domino problem," Mem. Amer. Math. Soc., vol. 66, 1966.
5. D. Brady and D. Psaltis, "Control of volume holograms," J. Opt. Soc. Amer. A, vol. 9, pp. 1167-1182, 1992.
6. R. Burton and J. E. Steif, "Non-uniqueness of measures of maximal entropy for subshifts of finite type," Ergod. Theory Dynam. Syst., vol. 14, pp. 213-235, 1994.
7. 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, 1998.
8. F. Champagnat, J. Idier, and Y. Goussard, "Stationary Markov random fields on a finite rectangular lattice," IEEE Trans. Inform. Theory, vol. 44, pp. 2901-2916, Nov. 1998.
9. K. Engel, "On the fibonacci number of an m × n lattice," Fibonacci Quart., vol. 28, pp. 72-78, 1990.
10. S. Halevy, "Two-dimensional coding for recording channels," M.Sc. thesis, Computer Sci. Dept., Technion, Haifa, Israel, 2001.
11. J. F. Heanue, M. C. Bashaw, and L. Hesselink, "Volume holographic storage and retrieval of digital data," Science, vol. 265, pp. 749-752, 1994.
12. ____, "Channel codes for digital holographic data storage," J. Opt. Soc. Amer. A, vol. 12, pp. 2432-2439, 1995.
13. H. Ito, A. Kato, Z. Nagy, and K. Zeger, "Zero capacity region of multi-dimensional run length constraints," Electr. J. Combin., vol. 6, p. R33, 1999.
14. J. Justesen and Y. M. Shtarkov, "The combinatorial entropy of images" (in Russian), Probl. Pered. Inform., vol. 33, pp. 3-11, 1997.
15. 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.
16. ____, "Partial characterization of the positive capacity region of two-dimensional asymmetric run length constrained channels," IEEE Trans. Inform. Theory, vol. 46, pp. 2666-2670, Nov. 2000.
17. Z. Kukorelly and K. Zeger, "The capacity of some hexagonal (d, k)-constraints," in Proc. IEEE Int. Symp. Information Theory, Washington, DC, June 2001, p. 64.
18. P. Lee, "Combined error-correcting/modulation recording codes," Ph.D. dissertation, Univ. California, San Diego, La Jolla, 1988.
19. M. Marcus, A Survey of Finite Mathematics. New York: Dover, 1969.
20. B. H. Marcus, R. M. Roth, and P. H. Siegel, "Constrained systems and coding for recording channels," in Handbook of Coding Theory, V. Pless and W. C. Huffman, Eds. Amsterdam, The Netherlands: Elsevier Scientific, pp. 1635-1764.
21. v subshifts of finite type," in Classical Mechanics and Dynamical Systems. ser. Lecture Notes in Pure and Applied Mathematics, R. Devaney and Z. Nitecki, Eds. New York: Marcel Dekker, 1981, vol. 70, pp. 135-137.
22. Z. Nagy and K. Zeger, "Capacity bounds for the 3-dimensional (0, 1) runlength limited channel," IEEE Trans. Inform. Theory, vol. 46, pp. 1030-1033, May 2000.
23. K. Norris and D. S. Bloomberg, "Channel capacity of charge-constrained run-length limited systems," IEEE Trans. Magn., vol. MAG-17, pp. 3452-3455, Nov. 1981.
24. K. C. Pohlmann, The Compact Disc Handbook, 2nd ed. Madison, WI: A-R Editions, 1992.
25. D. Psalti and F. Mok, "Holographic memories," Scientific Amer., vol. 273, no. 5, pp. 70-76, 1995.
26. D. Psaltis, M. A. Neifeld, A. Yamamura, and S. Kobayashi, "Optical memory disks in optical information processing," Appl. Opt., vol. 29, pp. 2038-2057, 1990.
27. R. M. Robinson, "Undecidability and nonperiodicity for tilings of the plane," Inventiones Math., vol. 12, pp. 177-209, 1971.
28. R. M. Roth, P. H. Siegel, and J. K. Wolf, "Efficient coding for a two-dimensional runlength-limited constraint," in Proc. SPIE Int. Symp. Optical Science, Engineering, and Instrumentation, Denver, CO, July 1999, pp. 8-17.
29. ____, "Efficient coding schemes for the two-dimensional runlength-limited (1, ∞) constraint," IEEE Trans. Inform. Theory, vol. 47, pp. 1166-1176, Mar. 2001.
30. Y. M. Shtarkov, S. Forchhammer, and J. Justesen, "On Definitions and Existence of Combinatorial Entropy of 2d Fields," Tech. Univ. Denmark, Lyngby, Tech. Rep. TR-TELE-10, 1998.
31. P. H. Siegel and J. K. Wolf, "Bit-stuffing bounds on the capacity of 2-dimensional constrained arrays," in Proc. 1998 IEEE Int. Symp. Information Theory, Cambridge, MA, Aug. 1998, p. 323.
32. R. Talyansky, "Coding for two-dimensional constraints," M.Sc. thesis (in Hebrew), Computer Sci. Dept., Technion, Haifa, Israel, 1997.
33. R. Talyansky, T. Etzion, and R. M. Roth, "Efficient constructions for certain two-dimensional constraints," IEEE Trans. Inform. Theory, vol. 45, pp. 794-799, Mar. 1999.
34. 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.