2 citations · 2 across the 2 of their papers we have counts for
4 papers · 1 filter
Bounds on the Rate of 2-D Bit-Stuffing Encoders
Ido Tal, Ron M. Roth
A method for bounding the rate of bit-stuffing encoders for 2-D constraints is presented. Instead of considering the original encoder, we consider a related one which is quasi-stat…
List Decoding of Burst Errors
Ron M. Roth, Pascal O. Vontobel
A generalization of the Reiger bound is presented for the list decoding of burst errors. It is then shown that Reed-Solomon codes attain this bound.
On row-by-row coding for 2-D constraints
Ido Tal, Tuvi Etzion, Ron M. Roth
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 slid…
Concave Programming Upper Bounds on the Capacity of 2-D Constraints
Ido Tal, Ron M. Roth
The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distribut…