Optimal insdel codes from almost MDS codes
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- A construction of non-Reed-Solomon type MDS codes
- Bounds and Constructions for Insertion and Deletion Codes
- Codes Correcting a Burst of Deletions or Insertions
- Coordinate-Ordering-Free Upper Bounds for Linear Insertion-Deletion Codes
- Correcting Deletions Using Linear and Cyclic Codes
- Deterministic document exchange protocols, and almost optimal binary codes for edit errors
- Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms
- Efficient Linear and Affine Codes for Correcting Insertions/Deletions
- Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime
- Improved Singleton Bound on Insertion-Deletion Codes and Optimal Constructions
- MDS or NMDS self-dual codes from twisted generalized Reed-Solomon codes
- Near-MDS codes over some small fields
- New dimension-independent upper bounds on linear insdel codes
- On a Problem of Sidon in Additive Number Theory, and on some Related Problems
- Optimal document exchange and new codes for insertions and deletions
- Optimal two-dimensional Reed-Solomon codes correcting insertions and deletions
- Roth-Lempel NMDS codes of non-elliptic-curve type
- Strict Half-Singleton Bound, Strict Direct Upper Bound for Linear Insertion-Deletion Codes and Optimal Codes
- Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound
This page was built for publication: Optimal insdel codes from almost MDS codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6894839)
