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
Two-dimensional constrained coding based on tiling
IEEE Transactions on Information Theory
Bounds on the rate of 2-D bit-stuffing encoders
IEEE Transactions on Information Theory
| Hi-index | 754.96 |
A modified bit-stuffing scheme for two-dimensional (2-D) checkerboard constraints is introduced. The entropy of the scheme is determined based on a probability measure defined by the modified bit-stuffing. Entropy results of the scheme are given for 2-D constraints on a binary alphabet. The constraints considered are 2-D RLL(d,infin) for d=2,3 and 4 as well as for the constraint with a minimum 1-norm distance of 3 between 1s. For these results the entropy is within 1-2% of an upper bound on the capacity for the constraint. As a variation of the scheme, periodic merging arrays are also considered