Title :
Bounds on the capacity of weakly constrained two-dimensional codes
Author :
Forchharnmer, S.
Author_Institution :
COM, DTU, Lyngby, Denmark
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.
Keywords :
channel capacity; codes; maximum entropy methods; probability; 2D channel models; channel capacity; code capacity bounds; coded data; lower bound; maximum entropy; probability; upper bound; weakly constrained 2D codes; weakly constrained two-dimensional codes; Capacity planning; Channel capacity; Constraint optimization; Entropy; Markov processes; Probability; Statistics; Stochastic processes; Upper bound; Yttrium;
Conference_Titel :
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN :
0-7803-7501-7
DOI :
10.1109/ISIT.2002.1023628
