Enumeration algorithms for constructing (d/sub 1/, /spl infin/, d/sub 2/, /spl infin/) run length limited arrays: capacity estimates and coding schemes

We present two enumeration algorithms for a class of (d/sub 1/, /spl infin/, d/sub 2/, /spl infin/) run-length limited (RLL) constrained arrays. Based on the structure of these algorithms, we derive bounds for the maximum information rate of the constraint. We also give encoders and decoders for coded 2D constrained arrays with rates close to the derived bounds.