Asymptotically good codes correcting insertions, deletions, and transpositions
From MaRDI portal
(Redirected from Publication:4503483)
Recommendations
- Reliable communication over channels with insertions, deletions, and substitutions
- Feedback insertion-deletion codes
- On multiple insertion/deletion correcting codes
- Nonbinary codes, correcting single deletion or insertion (Corresp.)
- Synchronization strings: list decoding for insertions and deletions
Cited in
(17)- Feedback insertion-deletion codes
- Less haste, less waste: on recycling and its limits in strand displacement systems
- On the Varshamov-Tenengolts construction on binary strings
- Detecting Substitutions and Transpositions of Characters
- Reliable communication over channels with insertions, deletions, and substitutions
- Variable-length codes for error correction
- A note on double insertion/deletion correcting codes
- Synchronization strings: list decoding for insertions and deletions
- scientific article; zbMATH DE number 7561530 (Why is no real title available?)
- Optimally resilient codes for list-decoding from insertions and deletions
- Privacy amplification with asymptotically optimal entropy loss
- Insdel codes from subspace and rank-metric codes
- Efficient Linear and Affine Codes for Correcting Insertions/Deletions
- Deterministic document exchange protocols and almost optimal binary codes for edit errors
- New dimension-independent upper bounds on linear insdel codes
- Amortized locally decodable codes for insertions and deletions
- Random Reed-Solomon codes achieve the half-singleton bound for insertions and deletions over linear-sized alphabets
This page was built for publication: Asymptotically good codes correcting insertions, deletions, and transpositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503483)
