On runlength codes
Ephraim Zehavi, Jack K. Wolf · IEEE Transactions on Information Theory · 1988
Several results on binary (d, k) codes are given. First, a novel derivation for the capacity of these codes based on information-theoretic principles is given. Based on this result the spectrum of a (d, k) code is computed. Finally, the problem of computing the capacity of the binary symmetric channel under the condition that the input sequences satisfy the (d, k) constraint is considered. Lower bounds on the capacity of such a channel are derived.>