Asymptotic capacity of two-dimensional channels with checkerboard constraints

This paper discusses the capacities of two-dimensional channels satisfying convex checkerboard constraints. We consider the two-dimensional channels satisfying run length constraints in relation to optical recording applications. Two-dimensional run length constraints require binary sequence i.e. satisfied both horizontally and vertically in a rectangular binary array.