A linear-time decoder recovers the codeword of a specially constructed [n,2] Reed-Solomon code from any n-3 surviving symbols.
Optimal two-dimensional reed–solomon codes correcting insertions and deletions
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.IT 1years
2024 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors
A linear-time decoder recovers the codeword of a specially constructed [n,2] Reed-Solomon code from any n-3 surviving symbols.