Bounds on the capacity of constrained two-dimensional codes

Søren Forchhammer; Jørn Justesen

doi:10.1109/18.887878

Bounds on the capacity of constrained two-dimensional codes

Søren Forchhammer
, Jørn Justesen

Research output: Contribution to journal › Journal article › Research › peer-review

651 Downloads (Orbit)

Abstract

Bounds on the capacity of constrained two-dimensional (2-D) codes are presented. The bounds of Calkin and Wilf apply to first-order symmetric constraints. The bounds are generalized in a weaker form to higher order and nonsymmetric constraints. Results are given for constraints specified by run-length limits or a minimum distance between pixels of a given value.

Original language	English
Journal	I E E E Transactions on Information Theory
Pages (from-to)	2659-2666
ISSN	0018-9448
DOIs	https://doi.org/10.1109/18.887878
Publication status	Published - 2000

Bibliographical note

Copyright: 2000 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/18.887878

S renFinal published version, 280 KB

OpenUrl availability

Check availability in DTU Findit

Cite this

@article{bead16b8cb74479fb50d7b7376ae78c0,

title = "Bounds on the capacity of constrained two-dimensional codes",

abstract = "Bounds on the capacity of constrained two-dimensional (2-D) codes are presented. The bounds of Calkin and Wilf apply to first-order symmetric constraints. The bounds are generalized in a weaker form to higher order and nonsymmetric constraints. Results are given for constraints specified by run-length limits or a minimum distance between pixels of a given value.",

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

note = "Copyright: 2000 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",

year = "2000",

doi = "10.1109/18.887878",

language = "English",

pages = "2659--2666",

journal = "I E E E Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Bounds on the capacity of constrained two-dimensional codes

AU - Forchhammer, Søren

AU - Justesen, Jørn

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

Y1 - 2000

N2 - Bounds on the capacity of constrained two-dimensional (2-D) codes are presented. The bounds of Calkin and Wilf apply to first-order symmetric constraints. The bounds are generalized in a weaker form to higher order and nonsymmetric constraints. Results are given for constraints specified by run-length limits or a minimum distance between pixels of a given value.

AB - Bounds on the capacity of constrained two-dimensional (2-D) codes are presented. The bounds of Calkin and Wilf apply to first-order symmetric constraints. The bounds are generalized in a weaker form to higher order and nonsymmetric constraints. Results are given for constraints specified by run-length limits or a minimum distance between pixels of a given value.

U2 - 10.1109/18.887878

DO - 10.1109/18.887878

M3 - Journal article

SN - 0018-9448

SP - 2659

EP - 2666

JO - I E E E Transactions on Information Theory

JF - I E E E Transactions on Information Theory

ER -

Bounds on the capacity of constrained two-dimensional codes

Abstract

Bibliographical note

Access to Document

OpenUrl availability

Fingerprint

Cite this