Introduction to algorithms
The Number of Independent Sets in a Grid Graph
SIAM Journal on Discrete Mathematics
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Cascading methods for runlength-limited arrays
IEEE Transactions on Information Theory
A practical method for approaching the channel capacity of constrained channels
IEEE Transactions on Information Theory
The capacity and coding gain of certain checkerboard codes
IEEE Transactions on Information Theory
On the capacity of two-dimensional run-length constrained channels
IEEE Transactions on Information Theory
Constrained systems with unconstrained positions
IEEE Transactions on Information Theory
Parallel constrained coding with application to two-dimensional constraints
IEEE Transactions on Information Theory
Enumeration of constant-weight run-length limited binary sequences
Problems of Information Transmission
| Hi-index | 754.84 |
A constant-rate encoder-decoder pair is presented for a fairly large family of two-dimensional (2-D) constraints. Encoding and decoding is done in a row-by-row manner, and is sliding-block decodable. Essentially, the 2-D constraint is turned into a set of independent and relativdy simple one-dimensional (1-D) constraints; this is done by dividing the array into fixed-width vertical strips. Each row in the strip is seen as a symbol, and a graph presentation of the respective 1-D constraint is constructed. The maxentropic stationary Markov chain on this graph is next considered: a perturbed version of the corresponding probability distribution on the edges of the graph is used in order to build an encoder which operates in parallel on the strips. This perturbation is found by means of a network flow, with upper and lower bounds on the flow through the edges. A key part of the encoder is an enumerative coder for constant-weight binary words. A fast realization of this coder is shown, using floating-point arithmetic.