An Upper Bound on the Entropy of Constrained 2d Fields

Søren Forchhammer; Jørn Justesen

doi:10.1109/ISIT.1998.708656

An Upper Bound on the Entropy of Constrained 2d Fields

Søren Forchhammer
, Jørn Justesen

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

406 Downloads (Orbit)

Abstract

An upper bound on the entropy of constrained 2D fields is presented. The constraints have to be symmetric in (at least) one of the two directions. The bound generalizes (in a weaker form) the bound of Calkin and Wilf (see SIAM Journal of Discrete Mathematics, vol.11, p.54-60, 1998) which is valid only for processes with symmetric transfer matrices. Results are given for constraints specified by run-length limits and minimum distance between pixels of the same color

Original language	English
Title of host publication	Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Number of pages	72
Place of Publication	Cambridge, MA, USA
Publisher	IEEE
Publication date	1998
ISBN (Print)	0-7803-5000-6
DOIs	https://doi.org/10.1109/ISIT.1998.708656
Publication status	Published - 1998
Event	Int'l. Symp. on Information Theory - Boston, Mass, USA Duration: 1 Jan 1998 → …

Conference

Conference	Int'l. Symp. on Information Theory
City	Boston, Mass, USA
Period	01/01/1998 → …

Bibliographical note

Copyright: 1998 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

Access to Document

10.1109/ISIT.1998.708656

ForchhammerFinal published version, 108 KB

OpenUrl availability

Full text

Cite this

@inproceedings{1b5dfd74f21942d4ac6731b22f56e954,

title = "An Upper Bound on the Entropy of Constrained 2d Fields",

abstract = "An upper bound on the entropy of constrained 2D fields is presented. The constraints have to be symmetric in (at least) one of the two directions. The bound generalizes (in a weaker form) the bound of Calkin and Wilf (see SIAM Journal of Discrete Mathematics, vol.11, p.54-60, 1998) which is valid only for processes with symmetric transfer matrices. Results are given for constraints specified by run-length limits and minimum distance between pixels of the same color",

author = "S{\o}ren Forchhammer and J{\o}rn Justesen",

note = "Copyright: 1998 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; Int'l. Symp. on Information Theory ; Conference date: 01-01-1998",

year = "1998",

doi = "10.1109/ISIT.1998.708656",

language = "English",

isbn = "0-7803-5000-6",

booktitle = "Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on",

publisher = "IEEE",

address = "United States",

}

TY - GEN

T1 - An Upper Bound on the Entropy of Constrained 2d Fields

AU - Forchhammer, Søren

AU - Justesen, Jørn

N1 - Copyright: 1998 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

PY - 1998

Y1 - 1998

N2 - An upper bound on the entropy of constrained 2D fields is presented. The constraints have to be symmetric in (at least) one of the two directions. The bound generalizes (in a weaker form) the bound of Calkin and Wilf (see SIAM Journal of Discrete Mathematics, vol.11, p.54-60, 1998) which is valid only for processes with symmetric transfer matrices. Results are given for constraints specified by run-length limits and minimum distance between pixels of the same color

AB - An upper bound on the entropy of constrained 2D fields is presented. The constraints have to be symmetric in (at least) one of the two directions. The bound generalizes (in a weaker form) the bound of Calkin and Wilf (see SIAM Journal of Discrete Mathematics, vol.11, p.54-60, 1998) which is valid only for processes with symmetric transfer matrices. Results are given for constraints specified by run-length limits and minimum distance between pixels of the same color

U2 - 10.1109/ISIT.1998.708656

DO - 10.1109/ISIT.1998.708656

M3 - Article in proceedings

SN - 0-7803-5000-6

BT - Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on

PB - IEEE

CY - Cambridge, MA, USA

T2 - Int'l. Symp. on Information Theory

Y2 - 1 January 1998

ER -

An Upper Bound on the Entropy of Constrained 2d Fields

Abstract

Conference

Bibliographical note

Access to Document

OpenUrl availability

Fingerprint

Cite this