Finite state models of constrained 2d data.

Jørn Justesen

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearch

    324 Downloads (Pure)

    Abstract

    This paper considers a class of discrete finite alphabet 2D fields that can be characterized using tools front finite state machines and Markov chains. These fields have several properties that greatly simplify the analysis of 2D coding methods.
    Original languageEnglish
    Title of host publicationIEEE International Symposium on Information Theory, Proceedings
    Number of pages160
    Place of PublicationChicago, USA
    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 'Finite state models of constrained 2d data.'. Together they form a unique fingerprint.

    Cite this