Bounds on the capacity of constrained two-dimensional codes

Søren Forchhammer, Jørn Justesen

    Research output: Contribution to journalJournal articleResearchpeer-review

    537 Downloads (Pure)

    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 languageEnglish
    JournalI E E E Transactions on Information Theory
    Pages (from-to)2659-2666
    ISSN0018-9448
    DOIs
    Publication statusPublished - 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

    Fingerprint

    Dive into the research topics of 'Bounds on the capacity of constrained two-dimensional codes'. Together they form a unique fingerprint.

    Cite this