Capacity Bounds for the 3-Dimensional (0, 1) Runlength Limited Channel
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
New upper and lower bounds on the channel capacity of read/write isolated memory
Discrete Applied Mathematics
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
On row-by-row coding for 2-D 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
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
Two-dimensional constrained coding based on tiling
IEEE Transactions on Information Theory
The 1-vertex transfer matrix and accurate estimation of channel capacity
IEEE Transactions on Information Theory
New bounds on the capacity of multi-dimensional RLL-Constrained systems
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
| Hi-index | 755.14 |
Two-dimensional binary patterns that satisfy one-dimensional (d, k) run-length constraints both horizontally and vertically are considered. For a given d and k, the capacity Cd,k is defined as Cd,k=limm,n→∞log2Nm,n d,k/mn, where Nm,nd,k denotes the number of m×n rectangular patterns that satisfy the two-dimensional (d,k) run-length constraint. Bounds on Cd,k are given and it is proven for every d⩾1 and every k>d that Cd,k=0 if and only if k=d+1. Encoding algorithms are also discussed