Coding of two-dimensional constraints of finite type by substitutions
Journal of Automata, Languages and Combinatorics
Capacity bounds for two-dimensional asymmetric M-ary (0, k) and (d,∞) runlength-limited channels
IEEE Transactions on Communications
Block pickard models for two-dimensional constraints
IEEE Transactions on Information Theory
Extending models for two-dimensional 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
A novel method for counting models on grid Boolean formulas
MCPR'10 Proceedings of the 2nd Mexican conference on Pattern recognition: Advances in pattern recognition
| Hi-index | 755.02 |
The hard-square model, also known as the two-dimensional (2-D) (1, ∞)-RLL constraint, consists of all binary arrays in which the 1's are isolated both horizontally and vertically. Based on a certain probability measure defined on those arrays, an efficient variable-to-fixed encoder scheme is presented that maps unconstrained binary words into arrays that satisfy the hard-square model. For sufficiently large arrays, the average rate of the encoder approaches a value which is only 0.1% below the capacity of the constraint. A second, fixed-rate encoder is presented whose rate for large arrays is within 1.2% of the capacity value