On Single-Deletion-Correcting Codes
<|reference_start|>On Single-Deletion-Correcting Codes: 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.<|reference_end|>
@article{sloane2002on,
    title={On Single-Deletion-Correcting Codes},
    author={N.J.A. Sloane},
    journal={Codes and Designs, Ohio State University, May 2000 (Ray-Chaudhuri
  Festschrift), K. T. Arasu and A. Seress (editors), Walter de Gruyter, Berlin,
  2002, pp. 273-291},
    year={2002},
    archivePrefix={arXiv},
    eprint={math/0207197},
    primaryClass={math.CO cs.IT math.IT}
}