Abstract
Upper and lower bounds are presented for the capacity of weakly constrained two-dimensional codes. The maximum entropy is calculated for two simple models of 2-D codes constraining the probability of neighboring 1s as an example. For given models of the coded data, upper and lower bounds on the capacity for 2-D channel models based on occurrences of neighboring 1s are considered.
Original language | English |
---|---|
Title of host publication | IEEE International Symposium on Information Theory, 2002. Proceedings. |
Number of pages | 356 |
Place of Publication | Lausanne, Switzerland |
Publisher | IEEE |
Publication date | 2002 |
ISBN (Print) | 0-7803-7501-7 |
DOIs | |
Publication status | Published - 2002 |
Event | 2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland Duration: 30 Jun 2003 → 6 Jul 2003 |
Conference
Conference | 2002 IEEE International Symposium on Information Theory |
---|---|
Country/Territory | Switzerland |
City | Lausanne |
Period | 30/06/2003 → 06/07/2003 |