Insdel codes from subspace and rank-metric codes
From MaRDI portal
Publication:6080133
DOI10.1016/j.disc.2023.113675MaRDI QIDQ6080133
Vaneet Aggarwal, Rakhi Pratihar
Publication date: 30 October 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
- Combinatorics of Permutations
- Nonbinary codes, correcting single deletion or insertion (Corresp.)
- Classification of the Deletion Correcting Capabilities of Reed–Solomon Codes of Dimension $2$ Over Prime Fields
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Asymptotically good codes correcting insertions, deletions, and transpositions
- Codes Correcting Two Deletions
- Efficiently List-Decodable Insertion and Deletion Codes via Concatenation
- Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime
- Synchronization Strings and Codes for Insertions and Deletions—A Survey
- Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound
- Improved Singleton Bound on Insertion-Deletion Codes and Optimal Constructions
- Synchronization Strings: Highly Efficient Deterministic Constructions over Small Alphabets
- Correcting Deletions Using Linear and Cyclic Codes
- Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms
- Construction of Sidon Spaces With Applications to Coding
This page was built for publication: Insdel codes from subspace and rank-metric codes
