On the capacity of two-dimensional run-length constrained channels |
| |
Authors: | Kato A Zeger K |
| |
Affiliation: | Dept. of Math. Eng. & Inf. Phys., Tokyo Univ. ; |
| |
Abstract: | Two-dimensional binary patterns that satisfy one-dimensional (d, k) run-length constraints both horizontally and vertically are considered. For a given d and k, the capacity Cd,k is defined as Cd,k=limm,n→∞log2Nm,n d,k/mn, where Nm,nd,k denotes the number of m×n rectangular patterns that satisfy the two-dimensional (d,k) run-length constraint. Bounds on Cd,k are given and it is proven for every d⩾1 and every k>d that Cd,k=0 if and only if k=d+1. Encoding algorithms are also discussed |
| |
Keywords: | |
|
|