Entropy bounds for constrained two-dimensional random fields

IEEE Transactions on Information Theory

Volumn 45, Issue 1, 1999, Pages 118-127

  Forchhammer, Sren ^a   Justesen, Jørn ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

2 d channel capacity; 2 d input constrained channels; 2 d run length limits; Data compression; Entropy bounds; Storage

Indexed keywords

CONSTRAINT THEORY; DATA STORAGE EQUIPMENT; DIGITAL IMAGE STORAGE; ENTROPY; RANDOM PROCESSES;

RANDOM FIELDS;

DATA COMPRESSION;

EID: 0032625906     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.746776     Document Type: Article

References (16)

1. K. A. S. Immink, Coding Techniques for Digital Recorders. Englewood Cliffs, NJ: Prentice-Hall, 1991.
2. L. Onsager, "Crystal statistics. I. A two-dimensional model with an order-disorder transition," Phys. Rev., vol. 65, pp. 117-149, 1944.
3. R. Burton and R. Pemantle, "Local characteristics, entropy and limit the-orems for spanning trees and domino tilings via transfer-impedances," Ann. Probab., vol. 21, pp. 1329-1371, 1993.
4. N. J. Calkin and H. S. Wilf, "The number of independent sets in a grid graph," S1AM J. Discr. Math. , vol. 11, pp. 54-60, Feb. 1998.
5. 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.
6. J. V. d. Berg and J. E. Steif, "Percolation and the hard-core lattice gas model," Stach. P roc. Appl., vol. 49, pp. 179-197, 1994.
7. J. Justesen and Y. Shtarkov, "The combinatorial entropy of images," Probl. Pered. Inform, (in Russian), vol. 33, pp. 3-11, 1997.
8. Y. Shtarkov, S. Forchhammer, and J. Justesen, "On definitions and existence of combinatorial entropy of 2d fields," Tech. Univ. Denmark, Tech. Rep. TR-TELE-10, 1998.
9. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379 23, July 1948.
10. R. Berger, "The undecidability of the domino problem," Memoirs Amer. Math. Soc., no. 66, 1966.
11. V. K. Wei and T. Etzion, "On two-dimensional run-length limited codes," in IEEE Information Theory Workshop (Brazil, 1992), p. 103.
12. D. K. Pickard, "A curious binary lattice process," J. Appl. Probab., vol. 14, pp. 717-731, 1977.
13. K. Abend, T. J. Harley, and L. N. Kanal, "Classification of binary random patterns," IEEE Trans. Inform. Theory, vol. IT11, pp. 538-544, 1965.
14. L. R. Rabiner, "A tutorial on hidden Markov models and selected applications in speech recognition," Proc. IEEE, vol. 77, pp. 257-286, Feb. 1989.
15. S. Forchhammer and J. Rissanen, "Partially hidden Markov models," IEEE Trans. Inform. Theory, vol. 42, pp. 1253-1256, July 1996.
16. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.