Decoding of Interleaved Alternant Codes

  title={Decoding of Interleaved Alternant Codes},
  author={Lukas Holzbaur and Hedongliang Liu and Alessandro Neri and Sven Puchinger and Johan Sebastian Rosenkilde and Vladimir R. Sidorenko and Antonia Wachter-Zeh},
  journal={IEEE Transactions on Information Theory},
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… 

Figures and Tables from this paper

Success Probability of Decoding Interleaved Alternant Codes

New general lower and upper bounds on the fraction of decodable error matrices are presented by Schmidt et al.

List Decoding of 2-Interleaved Binary Alternant Codes

Simulation results show that a decoding radius exceeding the binary Johnson radius can be achieved with a high probability of decoding success by the proposed algorithm.

Decoding of (Interleaved) Generalized Goppa Codes

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.



Success Probability of Decoding Interleaved Alternant Codes

New general lower and upper bounds on the fraction of decodable error matrices are presented by Schmidt et al.

Interleaved Reed-Solomon codes in concatenated code designs

It is demonstrated the gain, that can be obtained by interleaved Reed-Solomon decoding in comparison to independently decoding the several words of the underlying Reed- Solomon codes, if they are applied in concatenated code designs.

Decoding of Interleaved Reed Solomon Codes over Noisy Data

This work proposes a new decoding algorithm for interleaved Reed-Solomon Codes that attempts to correct all "interleaved" codewords simultaneously and presents and analyzes a novel probabilistic algorithm that solves this problem.

Decoding For Iterative Reed-solomon Coding Schemes

A novel approach for the decoding of interleaved codes is proposed based on a notion of covering error locators that locate error positions in two or more adjacent words that can correct more errors than the designed error correction ability.

Decoding interleaved Reed–Solomon codes beyond their joint error-correcting capability

A new probabilistic decoding algorithm for low-rate interleaved Reed–Solomon (IRS) codes is presented. This approach increases the error correcting capability of IRS codes compared to other known

Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs

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.

Efficient decoding of interleaved linear block codes

  • C. HaslachA. Vinck
  • Computer Science
    2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)
  • 2000
An efficient decoding algorithm that achieves the error correction capability of interleaved linear block codes is presented and a random access scheme is derived that has many similarities with the Aloha system.

Enhancing the Correcting Radius of Interleaved Reed-Solomon Decoding using Syndrome Extension Techniques

A new method for decoding IRS codes is described, which combines the idea of syndrome extension and the Idea of collaboratively decode IRS codes to increase the decoding radius of low-rate IRS codes.

Decoding of interleaved Reed-Solomon codes using improved power decoding

We propose a new partial decoding algorithm for m-interleaved Reed-Solomon (IRS) codes that can decode, with high probability, a random error of relative weight 1 − Rm/m+1 at all code rates R, in

Simultaneous Partial Inverses and Decoding Interleaved Reed–Solomon Codes

Two of the best performance bounds from the literature are generalized to hold for the partial-inverse condition and thus to apply to several different decoding algorithms.