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

DOI10.1109/18.243463zbMATH Open0801.94025OpenAlexW2092357676MaRDI QIDQ4307351FDOQ4307351

Authors: 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

Recommendations

• Optimal variable-length insertion-deletion correcting codes and edit metric codes
• On multiple insertion/deletion correcting codes
• Relationships between different error-correcting capabilities of a code
• scientific article; zbMATH DE number 4211968
• Insertion/deletion correction with spectral nulls

zbMATH Keywords

Levenshtein distanceinsertion-and-deletion correcting code

Mathematics Subject Classification ID

Other types of codes (94B60)

Cited In (10)

• An algebra of discrete channels that involve combinations of three basic error types
• Covering codes for the fixed length Levenshtein metric
• Improved Bounds for Codes Correcting Insertions and Deletions
• Properties of optimal and near optimal edit metric error correcting codes
• A generalization of the Lee distance and error correcting codes
• Generation of good edit codes from classical Hamming distance codes
• Relationships between different error-correcting capabilities of a code
• Optimal variable-length insertion-deletion correcting codes and edit metric codes
• A note on double insertion/deletion correcting codes
• On the construction of perfect deletion-correcting codes using design theory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4307351)