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