Bounds on the capacity of constrained two-dimensional codes

IEEE Transactions on Information Theory

Volumn 46, Issue 7, 2000, Pages 2659-2666

  Forchhammer, Søren ^a   Justesen, Jørn ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; CONSTRAINT THEORY; EIGENVALUES AND EIGENFUNCTIONS; FINITE AUTOMATA; MATRIX ALGEBRA; THEOREM PROVING;

CONSTRAINED CODES; MATHEMATICAL ENTROPY; MINIMUM DISTANCE; RUN LENGTH LIMITS; TWO DIMENSIONAL CODES;

BINARY CODES;

EID: 0034316027     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.887878     Document Type: Article

References (7)

1. J. Justesen and Y. Shtarkov, The combinatorial entropy of images, Probl. Pered. Inform., vol. 33, no. 1, pp. 3-11, 1997. (In Russian).
2. S. Friedland, On the entropy of Zd subshifts of finite type," Linear Alg. Appl., vol. 252, pp. 199-220, 1997.
3. S. Forchhammer and J. Justesen, Entropy bounds for constrained twodimensional random fields, IEEE Trans. Inform. Theory, vol. 45, pp. 118-127, Jan. 1999.
4. C. E. Shannon, A mathematical theory of communication, Bell Syst. Tech. J., vol. 27, pp. 37923, July 1948.
5. N. J. Calkin and H. S. Wilf, The number of independent sets in a grid graph, SIAMJ. Discr. Math., vol. 11, no. 1, pp. 54-60, Feb. 1998.
6. R. Burton and J. E. Steif, Non-uniqueness of measures of maximal entropy for subshifts of finite type, Ergod. Theory Dynam. Syst., vol. 14, pp. 213-235, 1994.
7. W. Weeks IV and R. E. Blahut, The capacity and coding gain of certain checkerboard codes, IEEE Trans. Inform. Theory, vol. 44, pp. 1193-1203, May 1998.