Bounds on the rate of 2-D bit-stuffing encoders

IEEE Transactions on Information Theory

Volumn 56, Issue 6, 2010, Pages 2561-2567

  Tal, Ido ^a,b   Roth, Ron M ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Bit stuffing encoders; Linear programming; Quasistationary distribution; Runlength limited constraints; Two dimensional constraints

Indexed keywords

BIT-STUFFING ENCODER; LINEAR PROGRAMS; LOWER BOUNDS; QUASI-STATIONARY; QUASI-STATIONARY DISTRIBUTION; RUNLENGTH-LIMITED CONSTRAINTS; TWO-DIMENSIONAL CONSTRAINTS;

OPTIMIZATION; TWO DIMENSIONAL;

LINEAR PROGRAMMING;

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

References (13)

1. S. Halevy and R. M. Roth, "Parallel constrained coding with application to two-dimensional constraints," IEEE Trans. Inf. Theory, vol.48, pp. 1009-1020, 2002 (Pubitemid 34555214)
2. P. Bender and J. K. Wolf, "A universal algorithm for generating optimal and nearly optimal run-length-limited, charge constrained binary sequences," presented at the IEEE Int. Symp. Inf. Theory (ISIT'1993), San Antonio, TX, 1993, 6
3. S. Halevy, J. Chen, R. M. Roth, P. H. Siegel, and J. K.Wolf, "Improved bit-stuffing bounds on two-dimensional constraints," IEEE Trans. Inf. Theory, vol.50, pp. 824-838, 2004
4. R. M. Roth, P. H. Siegel, and J. K. Wolf, "Efficient coding schemes for the Hard-Square model," IEEE Trans. Inf. Theory, vol.47, pp. 1166-1176, 2001
5. S. Forchhammer and T. V. Laursen, "Entropy of bit-stuffing-induced measures for two-dimensional checkerboard constraints," IEEE Trans. Inf. Theory, vol.53, pp. 1537-1546, 2007
6. N. Calkin and H. S. Wilf, "The number of independent sets in a grid graph," SIAM J. Discrete Math., vol.11, pp. 54-60, 1997
7. A. Sharov and R. M. Roth, "Two-dimensional constrained coding based on tiling," in Proc. IEEE Int. Symp. Inf. Theory (ISIT'2008), Toronto, ON, Canada, 2008, pp. 1468-1472
8. A. Sharov and R. M. Roth, "Two-dimensional constrained coding based on tiling," IEEE Trans. Inf. Theory, to be published
9. E. Ordentlich and R. M. Roth, "Capacity lower bounds and approximate enumerative coding for 2-D constraints," in Proc. IEEE Int. Symp. Inf. Theory (ISIT'2007), Nice, France, 2007, pp. 1681-1685
10. J. J. Ashley and B. H. Marcus, "Two-dimensional low-pass filtering codes," IEEE Trans. Commun., vol.46, pp. 724-727, 1998
11. S. Forchhammer and T. V. Laursen, "A model for the two-dimensional no isolated bits constraint," in Proc. IEEE Int. Symp. Inf. Theory (ISIT'2006), Seattle, WA, 2006, pp. 1189-1193
12. I. Tal and R. M. Roth, "Bounds on the rate of 2-D bit-stuffing encoders," presented at the IEEE Int. Symp. Inf. Theory (ISIT'2008), Toronto, ON, Canada, 2008
13. E. Ordentlich and R. M. Roth, "Approximate enumerative coding for 2-D constraints through ratios of matrix products," in Proc. IEEE Int. Symp. Inf. Theory (ISIT'2009), Seoul, Korea, 2009, pp. 1050-1054