Lower bounds on achievable rates for limited bitshift correcting codes

DOI10.1109/18.333860zbMath0813.94018OpenAlexW2123080044MaRDI QIDQ4324115

V. Yu. Krachkovskij, V. D. Kolesnik

Publication date: 1 March 1995

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.333860

zbMATH Keywords

Markov chainslower boundserror-correctionlimited codesbinary run length-limited codesbit-shift correcting codesbitshift distancebitshift errorsVarshamov- Gilbert bound

Mathematics Subject Classification ID

Applications of graph theory (05C90) Bounds on codes (94B65) Other types of codes (94B60)

This page was built for publication: Lower bounds on achievable rates for limited bitshift correcting codes