Bit-stuffing bounds on the capacity of 2-dimensional constrained arrays

Bit-stuffing constructions of binary 2-dimensional constrained arrays satisfying (d,/spl infin/) or (0,k) runlength constraints in both horizontal and vertical dimensions are described. Lower bounds on the capacity of these constrained arrays are derived.