Asymptotic capacity of two-dimensional channels with checkerboard constraints
A checkerboard constraint is a bounded measurable set S subset of R-2, containing the origin. A binary labeling of the Z(2) lattice satisfies the checkerboard constraint S if whenever t is an element of Z(2) is labeled 1, all of the other Z(2)-lattice points in the translate t + S are labeled 0. Two-dimensional channels that only allow labelings of Z(2) satisfying checkerboard constraints are studied. Let A(S) be the area of S, and let A(S) --> infinity mean that S retains its shape but is inflated in size in the form alphaS, as alpha --> infinity. It is shown that for any open checkerboard constraint S, there exist positive reals K-1 and K-2 such that as A(S) --> infinity, the channel capacity CS decays to zero at least as fast as (K-1 log(2) A(S))/A(S) and at most as fast as (K-2 log(2) A(S))/A(S). It is also shown that if S is an open convex and symmetric checkerboard constraint, then as A(S) --> infinity, the capacity decays exactly at the rate 4delta(S) (log(2) A (S)) /A (S), where delta(S) is the packing density of the set S. An implication. is that the capacity of such checkerboard constrained channels is asymptotically determined only by the areas of the constraint and the smallest (possibly degenerate) hexagon that can be circumscribed about the constraint. In particular, this establishes that channels with square, diamond, or hexagonal checkerboard constraints all asymptotically have the same capacity, since delta(S) = 1 for such constraints.
asymptotics constrained channel coding optical data storage run-length-limited codes