Finite state models of constrained 2d data.

Jørn Justesen

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

214 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
EventIEEE International Symposium on Information Theory, Proceedings -
Duration: 1 Jan 2004 → …

Conference

ConferenceIEEE International Symposium on Information Theory, Proceedings
Period01/01/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