On multiple insertion/deletion correcting codes
From MaRDI portal
Publication:4544787
DOI10.1109/18.971760zbMATH Open1059.94040OpenAlexW2120978458MaRDI QIDQ4544787FDOQ4544787
Authors: Albertus S. J. Helberg, Hendrik C. Ferreira
Publication date: 4 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.971760
Recommendations
- Multiple Criss-Cross Insertion and Deletion Correcting Codes
- A note on double insertion/deletion correcting codes
- A Multiple Insertion/Deletion Correcting Code for Run-Length Limited Sequences
- scientific article; zbMATH DE number 1867238
- Efficient Low-Redundancy Codes for Correcting Multiple Deletions
- Efficient Low-Redundancy Codes for Correcting Multiple Deletions
- New Multiple Insertion/Deletion Correcting Codes for Non-Binary Alphabets
- Criss-Cross Insertion and Deletion Correcting Codes
- Constructions of multi-permutation codes correcting a single burst of deletions
- On Helberg's Generalization of the Levenshtein Code for Multiple Deletion/Insertion Error Correction
Bounds on codes (94B65) Burst-correcting codes (94B20) Synchronization error-correcting codes (94B50)
Cited In (23)
- On the Varshamov-Tenengolts construction on binary strings
- Duplication-correcting codes
- Reliable communication over channels with insertions, deletions, and substitutions
- Title not available (Why is that?)
- Efficient Low-Redundancy Codes for Correcting Multiple Deletions
- Properties of optimal and near optimal edit metric error correcting codes
- Constructions and decoding of GC-balanced codes for edit errors
- Title not available (Why is that?)
- The Modular Subset-Sum Problem and the size of deletion correcting codes
- Deletion correcting codes meet the Littlewood-Offord problem
- Nonbinary codes, correcting single deletion or insertion (Corresp.)
- A number theoretic formula and asymptotic optimality of cardinalities of BAD correcting codes
- Burst-deletion-correcting codes for permutations and multipermutations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Feedback insertion-deletion codes
- Construction of single quantum deletion codes via combinatorial conditions and adjacency matrices
- Asymptotically good codes correcting insertions, deletions, and transpositions
- Nonbinary codes that correct symbol insertions, drop-outs, and substitutions
- Real-time error correction codes for deletable errors
- Decoding algorithms of monotone codes and azinv codes and their unified view
- Optimal variable-length insertion-deletion correcting codes and edit metric codes
- A note on double insertion/deletion correcting codes
This page was built for publication: On multiple insertion/deletion correcting codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544787)