New error-erasure decoders for interleaved linearized Reed-Solomon codes correct full errors, row erasures, and column erasures up to a probabilistic radius of s/(s+1)(n-k) with O(s n^2) average complexity.
Fast Decoding of Lifted Inter leaved Linearized Reed–Solomon Codes for Multishot Networ k Coding,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Syndrome-Based Error-Erasure Decoding of Interleaved Linearized Reed-Solomon Codes
New error-erasure decoders for interleaved linearized Reed-Solomon codes correct full errors, row erasures, and column erasures up to a probabilistic radius of s/(s+1)(n-k) with O(s n^2) average complexity.