Analysis of bit-stuffing codes and lower bounds on capacity for 2-D constrained arrays using quasistationary measures

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

    343 Downloads (Pure)

    Abstract

    A method for designing quasistationary probability measures for two-dimensional (2-D) constraints is presented. This measure is derived from a modified bit-stuff coding scheme and it gives the capacity of the coding scheme. This provides a constructive lower bound on the capacity of the 2-D constraint. The main examples are checkerboard codes with binary elements. The capacity for one instance of the modified bit-stuffing for the 2-D runlength-limited RLL(2,∞) constraint is calculated to be 0.4414 bits/symbol. For the constraint given by a minimum (1-norm) distance of 3 between 1s a code with capacity 0.3497 bits/symbol is given.
    Original languageEnglish
    Title of host publicationProceedings. International Symposium on Information Theory, 2004. ISIT 2004.
    Number of pages161
    PublisherIEEE
    Publication date2004
    ISBN (Print)0-7803-8280-3
    DOIs
    Publication statusPublished - 2004
    Event2004 IEEE International Symposium on Information Theory - Chicago Downtown Marriott, Chicago, United States
    Duration: 27 Jun 20042 Jul 2004

    Conference

    Conference2004 IEEE International Symposium on Information Theory
    LocationChicago Downtown Marriott
    Country/TerritoryUnited States
    CityChicago
    Period27/06/200402/07/2004

    Bibliographical note

    Copyright: 2004 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 'Analysis of bit-stuffing codes and lower bounds on capacity for 2-D constrained arrays using quasistationary measures'. Together they form a unique fingerprint.

    Cite this