Improved lower bounds on capacities of symmetric 2-dimensional constraints using Rayleigh quotients
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Approximate enumerative coding for 2-D constraints through ratios of matrix products
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Concave programming upper bounds on the capacity of 2-D constraints
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Improved lower bounds on capacities of symmetric 2D constraints using Rayleigh quotients
IEEE Transactions on Information Theory
Hi-index | 754.90 |
Bounds on the capacity of constrained two-dimensional (2-D) codes are presented. The bounds of Calkin and Wilf (see SIAM J. Discr. Math., vol.11, no.1, p.54-60, 1998) apply to first-order symmetric constraints. The bounds are generalized in a weaker form to higher order and nonsymmetric constraints. Results are given for constraints specified by run-length limits or a minimum distance between pixels of a given value