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

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 1463-1467

  Tal, Ido ^a   Roth, Ron M ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNATIONAL SYMPOSIUM; LINEAR PROGRAM; LOWER BOUNDS; QUASI-STATIONARY;

CONTROL THEORY; CYBERNETICS; INFORMATION THEORY; TECHNICAL PRESENTATIONS;

LINEAR PROGRAMMING;

EID: 52649175349     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4595230     Document Type: Conference Paper

References (11)

1. J. J. Ashley and B. H. Marcus, "Two-dimensional low-pass filtering codes," IEEE Trans. Commmun., 46 (1998), 724-727.
2. 6.
3. N. Calkin and H. S. Wilf, "The number of independent sets in a grid graph," SIAM J. Discrete Math. 11 (1997) 54-60.
4. S. Forchhammer and J. Justesen, "Bounds on the capacity of constrained two-dimensional codes," IEEE Trans. Inform. Theory, 46 (2000), 2659-2666.
5. S. Forchhammer and T. V. Laursen, "A model for the two-dimensional No Isolated Bits constraint," Proc. 2006 IEEE Symp. Inform. Theory (ISIT'2006), Seattle, Washington, 2006, pp. 1189-1193.
6. S. Forchhammer and T. V. Laursen, "Entropy of bit-stuffing-induced measures for two-dimensional checkerboard constraints," IEEE Trans. Inform. Theory, 53 (2007), 1537-1546.
7. S. Halevy, J. Chen, R. M. Roth, P. H. Siegel, and J. K. Wolf, "Improved bit-stuffing bounds on two-dimensional constraints," IEEE Trans. Inform. Theory, 50 (2004), 824-838.
8. S. Halevy and R. M. Roth, "Parallel constrained coding with application to two-dimensional constraints," IEEE Trans, Inform. Theory, 48 (2002), 1009-1020.
9. E. Ordentlich and R.M. Roth, "Capacity lower bounds and approximate enumerative coding for 2-D constraints," Proc. 2007 IEEE Symp. Inform. Theory (ISIT'2007), Nice, France, 2007, pp. 1681-1685.
10. R. M. Roth, P. H. Siegel, and J. K. Wolf, "Efficient coding schemes for the hard-square model," IEEE Trans. Inform. Theory, 47 (2001), 1166-1176.
11. I. Tal and R. M. Roth, "Concave programming upper bounds on the capacity of 2-D constraints," arXiv:YYMM.NNNN [category].