Finite state models of constrained 2d data.

Jørn Justesen

doi:10.1109/ISIT.2004.1365198

Finite state models of constrained 2d data.

Jørn Justesen

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research

302 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 language	English
Title of host publication	IEEE International Symposium on Information Theory, Proceedings
Number of pages	160
Place of Publication	Chicago, USA
Publisher	IEEE
Publication date	2004
ISBN (Print)	0-7803-8280-3
DOIs	https://doi.org/10.1109/ISIT.2004.1365198
Publication status	Published - 2004
Event	2004 IEEE International Symposium on Information Theory - Chicago Downtown Marriott, Chicago, United States Duration: 27 Jun 2004 → 2 Jul 2004

Conference

Conference	2004 IEEE International Symposium on Information Theory
Location	Chicago Downtown Marriott
Country/Territory	United States
City	Chicago
Period	27/06/2004 → 02/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

Access to Document

10.1109/ISIT.2004.1365198

JustesenFinal published version, 186 KB

OpenUrl availability

Full text

Cite this

@inproceedings{32abedf8b05a47c0830b0f22c2d9df16,

title = "Finite state models of constrained 2d data.",

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.",

author = "J{\o}rn Justesen",

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; 2004 IEEE International Symposium on Information Theory, ISIT 2004 ; Conference date: 27-06-2004 Through 02-07-2004",

year = "2004",

doi = "10.1109/ISIT.2004.1365198",

language = "English",

isbn = "0-7803-8280-3",

booktitle = "IEEE International Symposium on Information Theory, Proceedings",

publisher = "IEEE",

address = "United States",

}

TY - GEN

T1 - Finite state models of constrained 2d data.

AU - Justesen, Jørn

N1 - 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

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

U2 - 10.1109/ISIT.2004.1365198

DO - 10.1109/ISIT.2004.1365198

M3 - Article in proceedings

SN - 0-7803-8280-3

BT - IEEE International Symposium on Information Theory, Proceedings

PB - IEEE

CY - Chicago, USA

T2 - 2004 IEEE International Symposium on Information Theory

Y2 - 27 June 2004 through 2 July 2004

ER -

Finite state models of constrained 2d data.

Abstract

Conference

Bibliographical note

Access to Document

OpenUrl availability

Fingerprint

Cite this