Corpus ID: 222341266

Decoding of Interleaved Alternant Codes

@article{Holzbaur2020DecodingOI,
  title={Decoding of Interleaved Alternant Codes},
  author={Lukas Holzbaur and Hedongliang Liu and Alessandro Neri and S. Puchinger and J. Rosenkilde and V. Sidorenko and A. Wachter-Zeh},
  journal={ArXiv},
  year={2020},
  volume={abs/2010.07142}
}
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. This decoder may either fail to return a codeword, or it may 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… Expand

Figures and Tables from this paper

Decoding of (Interleaved) Generalized Goppa Codes
TLDR
A careful selection of the code locators leads to a lower bound on the minimum Hamming distance of generalized Goppa codes which improves upon previously known bounds. Expand
Success Probability of Decoding Interleaved Alternant Codes
TLDR
New general lower and upper bounds on the fraction of decodable error matrices are presented by Schmidt et al. Expand

References

SHOWING 1-10 OF 66 REFERENCES
A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
TLDR
A generalization of the Berlekamp-Massey algorithm is presented for synthesizing minimum length linear feedback shift registers for generating prescribed multiple sequences and conditions for guaranteeing that the connection polynomial of the shortestlinear feedback shift register obtained by the algorithm will be the error-locator polynometric are determined. Expand
Coding for combined block-symbol error correction
TLDR
This work designs low-complexity error correction coding schemes for channels that introduce different types of errors and erasures and shows that these schemes can successfully deal with symbol errors andErasures and also handle phased burst errors. Expand
A general decoding technique applicable to replicated file disagreement location and concatenated code decoding
TLDR
Two applications are considered where the probability of the error patterns being linearly dependent decreases exponentially with r, and a decoding techinque is described for which complexity increases no greater than as n/sup 3/, for any choice of code. Expand
Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs
TLDR
Coll collaborative decoding of interleaved Reed-Solomon codes by multisequence shift-register synthesis is considered and analyzed, and concatenated code designs are investigated, which are obtained by interleaving several Reed- Solomon codes, and Concatenating them with an inner code. Expand
Algorithms for simultaneous Hermite-Padé approximations
TLDR
Two algorithms are developed that generate the complete set of solutions to the input approximation problem that satisfy the given degree constraints using Hermite–Pade approximations over a polynomial ring K. Expand
Success Probability of Decoding Interleaved Alternant Codes
TLDR
New general lower and upper bounds on the fraction of decodable error matrices are presented by Schmidt et al. Expand
Algebraic geometry codes and some applications
TLDR
This article surveys the development of the theory of algebraic geometry codes since their discovery in the late 70's and presents various modern applications of these codes such as public-key cryptography, algebraic complexity theory, multiparty computation or distributed storage. Expand
Improved power decoding of interleaved one-point Hermitian codes
TLDR
An adaption of the improved power decoding algorithm to one-point Hermitian codes, which for all simulated parameters achieves a similar observed failure probability as the Guruswami–Sudan decoder above the latter’s guaranteed decoding radius. Expand
On Decoding and Applications of Interleaved Goppa Codes
TLDR
A modified version of the McEliece cryptosystem using wild IGC based on a recently proposed system by Elleuch et al., analyze attacks on the system and present some parameters with the corresponding key sizes. Expand
On Error Decoding of Locally Repairable and Partial MDS Codes
TLDR
It is shown that there is a wide range of parameters for which interleaved decoding can increase their decoding radius beyond the minimum distance with the probability of successful decoding approaching 1, when the code length goes to infinity. Expand
...
1
2
3
4
5
...