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
Hi-index | 754.90 |
The maximum entropy and thereby the capacity of two-dimensional (2-D) fields given by certain constraints on configurations is considered. Upper and lower bounds are derived. A new class of 2-D processes yielding good lower bounds is introduced. Asymptotically, the process achieves capacity for constraints with limited long-range effects. The processes are general and may also be applied to, e.g., data compression of digital images. Results are given for the binary hard square model, which is a 2-D run-length-limited model and some other 2-D models with simple constraints