Any (ρ, 2ρn+1, L)-list-recoverable code is a (ρ, L)-list-decodable insdel code, yielding the first polynomial-time insdel decoder for [n,k] Reed-Solomon codes with k > 2.
Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Constructing Reed-Solomon (RS) codes that can correct insertion and deletion (ins-del) errors has been the focus of several recent studies. However, efficient decoding algorithms for such codes have received less attention and remain a significant open problem. In this work, we take a first step toward addressing this problem by designing a decoding algorithm for the case of $2$-dimensional RS codes that can correct deletions up to the half-Singleton bound and is optimal in terms of field operations.
fields
cs.IT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Decoding Insertions/Deletions via List Recovery
Any (ρ, 2ρn+1, L)-list-recoverable code is a (ρ, L)-list-decodable insdel code, yielding the first polynomial-time insdel decoder for [n,k] Reed-Solomon codes with k > 2.