The capacity and coding gain of certain checkerboard codes

We investigate the capacity of two-dimensional constrained codes using a recursive construction and numerical convergence-speeding techniques. Using our best value of the capacity, we define and compute a measure of coding gain which allows us to compare checkerboard codes to simple coding schemes.