On row-by-row coding for 2-D constraints
IEEE Transactions on Information Theory
Improved lower bounds on capacities of symmetric 2-dimensional constraints using Rayleigh quotients
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
Bounds on the rate of 2-D bit-stuffing encoders
IEEE Transactions on Information Theory
| Hi-index | 755.02 |
A parallel constrained coding scheme is considered where p-blocks of raw data are encoded simultaneously into q tracks such that the contents of each track belong to a given constraint S. It is shown that as q increases, there are parallel block-decodable encoders for S whose coding ratio p/q converges to the capacity of S. Examples are provided where parallel coding allows block-decodable encoders, while conventional coding, at the same rate, does not. Parallel encoders are then applied as building blocks in the construction of block-decodable encoders for certain families of two-dimensional constraints