Decoding of Interleaved Alternant Codes
From MaRDI portal
Abstract: Interleaved Reed-Solomon codes admit efficient decoding algorithms which correct burst errors far beyond half the minimum distance in the random errors regime, e.g., by computing a common solution to the Key Equation for each Reed-Solomon code, as described by Schmidt et al. If this decoder does not succeed, it may either fail to return a codeword or miscorrect to an incorrect codeword, and good upper bounds on the fraction of error matrices for which these events occur are known. The decoding algorithm immediately applies to interleaved alternant codes as well, i.e., the subfield subcodes of interleaved Reed-Solomon codes, but the fraction of decodable error matrices differs, since the error is now restricted to a subfield. In this paper, we present new general lower and upper bounds on the fraction of error matrices decodable by Schmidt et al.'s decoding algorithm, thereby making it the only decoding algorithm for interleaved alternant codes for which such bounds are known.
Recommendations
- On decoding procedures of intertwining codes
- Decoding interleaved Gabidulin codes using Alekhnovich's algorithm
- Decoding interleaved Reed-Solomon codes over noisy channels
- Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability
- scientific article; zbMATH DE number 2038702
- Cryptography and Coding
- scientific article; zbMATH DE number 1714659
- Simultaneous Partial Inverses and Decoding Interleaved Reed–Solomon Codes
- On interleaved, differentially encoded convolutional codes
- Comparison of two algorithms for decoding alternant codes
Cited in
(3)
This page was built for publication: Decoding of Interleaved Alternant Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5032639)
