Capacity lower bounds and approximate enumerative coding for 2-D constraints

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 1681-1685

  Ordentlich, Erik ^a   Roth, Ron M ^b  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

LOWER BOUNDS;

CYBERNETICS; DECODING; INFORMATION THEORY; PROGRAMMING THEORY;

CONTROL THEORY;

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

References (11)

1. N.J. CALKIN, H.S. WILF, The number of independent sets in a grid graph, SIAM J. Discr. Math., 11 (1998), 54-60.
2. T.M. COVER, Enumerative source encoding, IEEE Trans. Inform. Theory, 19 (1973), 73-77.
3. S. FORCHHAMMER, Analysis of bit-stuffing codes and lower bounds on capacity for 2-D constrained arrays using quasistationary measures, in Proc. IEEE Int'l Symp. on Inform. Theory, Chicago, IL (2004), p. 161.
4. S. HALEVY, J.CHEN, R.M. ROTH, P.H. SIEGEL, J.K. WOLF, Improved bit-stuffing bounds on two-dimensional constraints, IEEE Trans. Inform. Theory, 50 (2004), 824-838.
5. K.A.S. IMMINK, A practical method for approaching the channel capacity of constrained channels, IEEE Trans. Inform. Theory, 43 (1997), 1389-1399.
6. B.H. MARCUS, R.M. ROTH, P.H. SIEGEL, Constrained systems and coding for recording channels, in Handbook of Coding Theory, Vol. II, VS. Pless, W.C. Huffman (Eds.), North-Holland, Amsterdam, 1998, pp. 1635-1764.
7. Z. NAGY, K. ZEGER, Capacity bounds for the three-dimensional (0,1) run length limited channel, IEEE Trans. Inform. Theory, 46 (2000), 1030-1033.
8. E. ORDENTLICH, R.M. ROTH, Two-dimensional weight-constrained codes through enumeration bounds, IEEE Trans. Inform. Theory, 46 (2000), 1292-1301.
9. R.M. ROTH, P.H. SIEGEL, J.K. WOLF, Efficient coding schemes for the hard-square model, IEEE Trans. Inform. Theory, 47 (2001), 1166-1176.
10. I. TAL, T. ETZION, R.M. ROTH, On row-by-row coding for 2-D constraints, Proc. IEEE Int'l Symp. on Inform. Theory, Seattle, WA (2006), 1204-1208.
11. W. WEEKS IV, R.E. BLAHUT, The capacity and coding gain of certain checkerboard codes, IEEE Trans. Inform. Theory, 44 (1998), 1193-1203.