Bounds on the zero-error capacity of the input-constrained bit-shift channel
V.Yu. Krachkovsky · IEEE Transactions on Information Theory · 1994
New lower and upper bounds on a maximal achievable rate fur runlength-limited codes, capable of correcting any combination of bit-shift errors (i.e. a zero-error capacity of the bit-shift channel), are presented. The lower bound is a generalization of the bound obtained by Shamai and Zehavi (1991). It is shown that in certain cases, the upper and the lower bounds asymptotically coincide.>