Bit-stuffing algorithms and analysis for run-length constrained channels in two and three dimensions

IEEE Transactions on Information Theory

Volumn 50, Issue 12, 2004, Pages 3146-3169

  Nagy, Zsigmond ^a   Zeger, Kenneth ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Bit allocation; Lossy source coding; Quantization; Transform coding

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; ENCODING (SYMBOLS);

BIT ALLOCATION; LOSSY SOURCE CODING; TRANSFORM CODING;

COMMUNICATION CHANNELS (INFORMATION THEORY);

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

References (23)

1. 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.
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. T. Etzion, "Cascading methods for runlength-limited arrays," IEEE Trans. Inform. Theory, vol. 43, pp. 319-324, Jan. 1997.
4. Z. Nagy and K. Zeger, "Asymptotic capacity of two-dimensional channels with checkerboard constraints," IEEE Trans. Inform. Theory, vol. 49, pp. 2115-2125, Sept. 2003.
5. R. E. Swanson and J. K. Wolf, "A new class of two-dimensional runlength-limited recording codes," IEEE Trans. Magn. Recording, vol. 28, pp. 3407-3416, Nov. 1992.
6. 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.
7. 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.
8. S. Forchhammer, "Upper bounds on the capacity of constrained three-dimensional codes," in Proc. IEEE 2000 Int. Symp. Information Theory, Sorrento, Italy, June 2000.
9. Z. Nagy and K. Zeger, "Capacity bounds for the three-dimensional (0, 1) run length limited channel," IEEE Trans. Inform. Theory, vol. 46, pp. 1030-1033, May 2000.
10. H. Ito, A. Kato, Z. Nagy, and K. Zeger, "Zero capacity region of multi-dimensional run length constraints," Electron. J. Comb., vol. 6, no. 1, p. R33, 1999.
11. E. Ordentlich and R. M. Roth, "Two-dimensional weight-constrained codes through enumeration bounds," IEEE Trans. Inform. Theory, vol. 46, pp. 1292-1301, July 2000.
12. A. Vardy, M. Blaum, P. H. Siegel, and G. T. Sincerbox, "Conservative arrays: Multidimensional modulation codes for holographic recording," IEEE Trans. Inform. Theory, vol. 42, pp. 227-230, Jan. 1996.
13. 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.
14. K. Engel, "On the Fibonacci number of an m x n lattice," Fibonacci Quart., vol. 28, pp. 72-78, 1990.
15. P. Lee, "Combined error-correcting/modulation recording codes," Ph.D. dissertation, Univ. Calif., San Diego, La Jolla, 1988.
16. P. Bender and J. K. Wolf, "A universal algorithm for generating optimal and nearly optimal ran-length-limited, charge constrained binary sequences," in Proc. 1993 IEEE Int. Symp. Information Theory, San Antonio, TX, Jan. 1993, p. 6.
17. 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.
18. S. Halevy, J. Chen, R. M. Roth, P. H. Siegel, and J. K. Wolf, " Improved bit-stuffing bounds on 2-dimensional constraints," in Proc. 2002 IEEE Int. Symp. Information Theory, Lausanne, Switzerland, June/July 2002, p. 385.
19. R. M. Roth, P. H. Siegel, and J. K. Wolf, "Efficient coding for a two-dimensional runlength-limited constraint," Proc. SPIE - The International Society for Optical Engineering, vol. 3802, pp. 8-17, July 1999.
20. 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.
21. 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.
22. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, no. 3 and 4, pp. 379-423, July and Oct. 1948.
23. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.