Levenshtein: describe message errors with insertion, deletion and bit-flip distances

What changed

Binary edit metrics characterize correction of deletion, insertion and bit-flip errors; equal-length deletion and insertion correction are equivalent, and checksum constructions address one-error synchronization.

Scientific scope

Binary edit metrics characterize correction of deletion, insertion and bit-flip errors; equal-length deletion and insertion correction are equivalent, and checksum constructions address one-error synchronization. The original coding results concern specified binary strings and deletion/insertion/reversal or related error models. Error distance, fixed length and correction guarantees must retain their definitions. This is not a universal modern text-similarity metric or proof that every edit-noise channel has the same coding capacity. Later generalized edit algorithms are separate.

Evidence

Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.

Contributors

• V. I. Levenshtein · SCIENCE: Soleoriginal scientificbyline;Russian1965/English1966samefamily.
• R.R.Varshamov; G.M.Tenengoltts; R.W.Hamming · SCIENCE: Explicitly credited prior checksum construction and bit-error-code bound, distinct from this paper's coauthors.
• P.S.Novikov · PARTICIPATION: PresentedtoAcademy;notbylineauthor orautomatic scientificownership.

• V. I. Levenshtein: Binary Codes Capable of Correcting Deletions, Insertions, and Reversals (1966 translation of 1965 original)

Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction