On Single-Deletion-Correcting Codes
classification
🧮 math.CO
cs.ITmath.IT
keywords
codesremainsingle-deletion-correctingappearbinarybriefconnectionsgives
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.