A note on double insertion/deletion correcting codes

DOI10.1109/TIT.2002.806155MaRDI QIDQ4679898zbMATH OpenOpenAlexFDO

Authors Theo G. Swart, Hendrik C. Ferreira

Publication date 31 May 2005

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

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

Mathematics Subject Classification ID

Other types of codes (94B60)

Recommendations

• On multiple insertion/deletion correcting codes
• scientific article; zbMATH DE number 1867238
• Asymptotically good codes correcting insertions, deletions, and transpositions
• scientific article; zbMATH DE number 3313261
• On double-byte error-correcting codes
• On Helberg's Generalization of the Levenshtein Code for Multiple Deletion/Insertion Error Correction
• Multiple Criss-Cross Insertion and Deletion Correcting Codes
• Insertion/Deletion Detecting Codes and the Boundary Problem
• A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes
• Criss-Cross Insertion and Deletion Correcting Codes

Cited in

(3)

• Algorithms for subsequence combinatorics
• On multiple insertion/deletion correcting codes
• Randomized generation of error control codes with automata and transducers

This page was built for publication: A note on double insertion/deletion correcting codes

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