.png){kind=icon}
.png){kind=icon}
Return
Optimally Decoding 2-D Reed-Solomon Codes Against Deletion Errors
.png){kind=icon}
PRE
AI
DOI：10.1109/TIT.2026.3656004.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Codes
Decoding
Symbols
Linear codes
Reed-Solomon codes
Measurement
Encoding
Vectors
Hamming distances
Frequency locked loops
Reed-Solomon (RS) codes
deletion errors
decoding algorithms
Journal
I
IF:
2.9
Papers:
317
Citations:
0