Analysis of bit-stuffing codes and lower bounds on capacity for 2-D constrained arrays using quasistationary measures

A method for designing quasistationary probability measures for two-dimensional (2-D) constraints is presented. This measure is derived from a modified bit-stuff coding scheme and it gives the capacity of the coding scheme. This provides a constructive lower bound on the capacity of the 2-D constraint. The main examples are checkerboard codes with binary elements. The capacity for one instance of the modified bit-stuffing for the 2-D runlength-limited RLL(2,/spl infin/) constraint is calculated to be 0.4414 bits/symbol. For the constraint given by a minimum (1-norm) distance of 3 between 1s a code with capacity 0.3497 bits/symbol is given.