An upper bound on the entropy of constrained 2D fields

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 1998, Pages 72-

  Forchhammer, S ^a   Justesen, J ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

2D FIELDS; DISCRETE MATHEMATICS; MINIMUM DISTANCE; RUN LENGTH; TRANSFER MATRIXES; TWO DIRECTIONS; UPPER BOUND;

INFORMATION THEORY; MATHEMATICAL TECHNIQUES; TRANSFER MATRIX METHOD;

ENTROPY;

EID: 84888076141     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.1998.708656     Document Type: Conference Paper

References (3)

1. N. J. Calkin and H. S. Wiif, "The number of independent sets in a grid graph," SIAM Journal of Discrete Mathematics, vol. 11, pp. 54-60, 1998.
2. S. Forchhammer and J. Justesen, "Entropy bounds for constrained two-dimensional random fields," IEEE Trans, Inform. Theory to appear.
3. W. Weeks IV, Checkerboard codes, Master Thesis, University of Illinois, Urbana-Champaign, 1996.