Capacity-achieving codes for noisy insertion channels
From MaRDI portal
Cites work
- \(t\)-deletion-\(s\)-insertion-burst correcting codes
- Asymptotically optimal codes for (t, s)-burst error
- Capacity and Expressiveness of Genomic Tandem Duplication
- Codes Correcting a Burst of Deletions or Insertions
- Codes Correcting Two Deletions
- Duplication-correcting codes
- Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms
- Error-Correcting Codes for Noisy Duplication Channels
- Error-Correcting Codes for Short Tandem Duplication and Edit Errors
- Explicit construction of \(q\)-ary 2-deletion correcting codes with low redundancy
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- Low-Redundancy Codes for Correcting Multiple Short-Duplication and Edit Errors
- Non-binary codes for correcting a burst of at most \(t\) deletions
- Non-binary two-deletion correcting codes and burst-deletion correcting codes
- Nonbinary codes, correcting single deletion or insertion (Corresp.)
- On duplication-free codes for disjoint or equal-length errors
- On multiple insertion/deletion correcting codes
- On the coding capacity of reverse-complement and palindromic duplication-correcting codes
- On the Reverse-Complement String-Duplication System
- Single-Error Detection and Correction for Duplication and Substitution Channels
- The Capacity of String-Duplication Systems
- Two Deletion Correcting Codes From Indicator Vectors
This page was built for publication: Capacity-achieving codes for noisy insertion channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7391761)
