On Single-Deletion-Correcting Codes
Combinatorics
2014-09-18 v1 Information Theory
math.IT
Abstract
This paper gives a brief survey of binary single-deletion-correcting codes. The Varshamov-Tenengolts codes appear to be optimal, but many interesting unsolved problems remain. The connections with shift-register sequences also remain somewhat mysterious.
Cite
@article{arxiv.math/0207197,
title = {On Single-Deletion-Correcting Codes},
author = {N. J. A. Sloane},
journal= {arXiv preprint arXiv:math/0207197},
year = {2014}
}
Comments
23 pages, 1 figure. Dedicated to Dijen Ray-Chaudhuri on the occasion of his 65th birthday