Lower bounds on achievable rates for limited bitshift correcting codes
Victor D. Kolesnik, V.Yu. Krachkovsky · IEEE Transactions on Information Theory · 1994
Limited codes (runlength-limited, charge constrained, and so on) capable of correcting shifts of their symbols are considered. The error-correction ability is characterized by the minimal bitshift distance d/sub BS/ of a code. For a given /spl delta/=d/sub BS//n, where n is the code length, the achievable code rate R/sub /spl alpha// is lower bounded. We prove the existence of codes of rate R/spl ges/R/sub /spl alpha//.>