A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes

DOI10.1109/18.243463zbMath0801.94025OpenAlexW2092357676MaRDI QIDQ4307351

Henk D. L. Hollmann

Publication date: 4 October 1994

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

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

zbMATH Keywords

Levenshtein distanceinsertion-and-deletion correcting code

Mathematics Subject Classification ID

Other types of codes (94B60)

Related Items (2)

On the construction of perfect deletion-correcting codes using design theory ⋮ An algebra of discrete channels that involve combinations of three basic error types

This page was built for publication: A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes