Zero capacity region of multidimensional run length constraints (Q1305171)

An \(n\)-dimensional pattern of zeros and ones arranged in an \(m_1\times m_2\times\cdots\times m_n\) hyper-rectangle is said to be \((d,k)\)-constrained if there are at most \(k\) consecutive zeros and between every two ones there are at least \(d\) consecutive zeros in the binary sequence in each of the \(n\) coordinate axis directions. The maximum number of bits of information that can be stored asymptotically per unit volume in \(n\)-dimensional space without violating the \((d,k)\)-constraint is said to be the \((d,k)\)-capacity. In the paper two theorems that characterize zero capacity region for finite dimensions and in the limit of large dimensions have been presented. One of them generalizes a result of the second and fourth authors [IEEE Trans. Inf.Theory 45, 1527-1540 (1999)].