Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound
From MaRDI portal
Recommendations
- Synchronization strings: codes for insertions and deletions approaching the Singleton bound
- Synchronization strings: list decoding for insertions and deletions
- Synchronization strings: explicit constructions, local decoding, and applications
- Synchronization strings: highly efficient deterministic constructions over small alphabets
- Synchronization strings: channel simulations and interactive coding for insertions and deletions
Cited in
(14)- Synchronization strings: explicit constructions, local decoding, and applications
- Some general results of coding theory with applications to the study of codes for the correction of synchronization errors
- Shortest synchronizing strings for Huffman codes
- Efficient Linear and Affine Codes for Correcting Insertions/Deletions
- Synchronization strings: codes for insertions and deletions approaching the Singleton bound
- Synchronization strings: highly efficient deterministic constructions over small alphabets
- New dimension-independent upper bounds on linear insdel codes
- Synchronization strings: list decoding for insertions and deletions
- Synchronization strings: channel simulations and interactive coding for insertions and deletions
- On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability
- Insdel codes from subspace and rank-metric codes
- Optimal insdel codes from almost MDS codes
- Near-linear time insertion-deletion codes and \((1+\varepsilon)\)-approximating edit distance via indexing
- Deterministic document exchange protocols and almost optimal binary codes for edit errors
This page was built for publication: Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056425)
