Entropy estimates for simple random fields

Søren Forchhammer, Jørn Justesen

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

285 Downloads (Pure)


We consider the problem of determining the maximum entropy of a discrete random field on a lattice subject to certain local constraints on symbol configurations. The results are expected to be of interest in the analysis of digitized images and two dimensional codes. We shall present some examples of binary and ternary fields with simple constraints. Exact results on the entropies are known only in a few cases, but we shall present close bounds and estimates that are computationally efficient
Original languageEnglish
Title of host publicationProceedings of the IEEE International Symposium on Information Theory
Publication date1995
ISBN (Print)07-80-32453-6
Publication statusPublished - 1995
Event1995 IEEE International Symposium on Information Theory - Whistler, Canada
Duration: 17 Sep 199522 Sep 1995


Conference1995 IEEE International Symposium on Information Theory
Internet address

Bibliographical note

Copyright: 1995 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE


Dive into the research topics of 'Entropy estimates for simple random fields'. Together they form a unique fingerprint.

Cite this