Approximate enumerative coding for 2-D constraints through ratios of matrix products

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 1050-1054

  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; MATRIX PRODUCTS; RUN LENGTH;

CONTROL THEORY; TWO DIMENSIONAL;

INFORMATION THEORY;

EID: 70449515630     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5206057     Document Type: Conference Paper

References (7)

1. T.M. COVER, Enumerative source encoding, IEEE Trans. Inform. Theory, 19 (1973), 73-77.
2. S. FORCHHAMMER, J. JUSTESEN, Bounds on the capacity of constrained two-dimensional codes, IEEE Trans. Inform. Theory, 46 (2000), 2659-2666.
3. S. FORCHHAMMER, T.V. LAURSEN, Entropy of bit-stuffing-induced measures for two-dimensional checkerboard constraints, IEEE Trans. Inform. Theory, 53 (2007), 1537-1546.
4. K.A.S. IMMINK, A practical method for approaching the channel capacity of constrained channels, IEEE Trans. Inform. Theory, 43 (1997), 1389-1399.
5. B.H. MARCUS, R.M. ROTH, P.H. SIEGEL, Constrained systems and coding for recording channels, in Handbook of Coding Theory, Vol. II, V.S. Pless, W.C. Huffman (Eds.), North-Holland, Amsterdam, 1998, pp. 1635-1764.
6. E. ORDENTLICH, R.M. ROTH, Two-dimensional weight-constrained codes through enumeration bounds, IEEE Trans. Inform. Theory, 46 (2000), 1292-1301.
7. E. ORDENTLICH, R.M. ROTH, Capacity lower bounds and approximate enumerative coding for 2-D constraints, in Proc. IEEE Int'l Symp. on Inform. Theory, Nice, France (2007), 1681-1685.