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
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
Bounds on the rate of 2-D bit-stuffing encoders
IEEE Transactions on Information Theory
A bit-stuffing algorithm for crosstalk avoidance in high speed switching
INFOCOM'10 Proceedings of the 29th conference on Information communications
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 | 754.96 |
We derive lower bounds on the capacity of certain two-dimensional (2-D) constraints by considering bounds on the entropy of measures induced by bit-stuffing encoders. A more detailed analysis of a previously proposed bit-stuffing encoder for (d,∞)-runlength-limited (RLL) constraints on the square lattice yields improved lower bounds on the capacity for all d ≥ 2. This encoding approach is extended to (d,∞)-RLL constraints on the hexagonal lattice, and a similar analysis yields lower bounds on the capacity for d ≥ 2. For the hexagonal (1,∞)-RLL constraint, the exact coding ratio of the bit-stuffing encoder is calculated and is shown to be within 0.5% of the (known) capacity. Finally, a lower bound is presented on the coding ratio of a bit-stuffing encoder for the constraint on the square lattice where each bit is equal to at least one of its four closest neighbors, thereby providing a lower bound on the capacity of this constraint.