# Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff

@article{Weber2012AsymptoticSS,
title={Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff},
author={Jos H. Weber and Vladimir R. Sidorenko and Christian Senger and Khaled A. S. Abdel-Ghaffar},
journal={Problems of Information Transmission},
year={2012},
volume={48},
pages={324-333}
}
• Published 1 October 2012
• Computer Science
• Problems of Information Transmission
Generalized minimum distance (GMD) decoders allow for combining some virtues of probabilistic and algebraic decoding approaches at a low complexity. We investigate single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff, based on either erasing a fraction of the received symbols or erasing all symbols whose reliability values are below a certain threshold. The fraction/threshold may be either static or adaptive, where adaptive means that the erasing is a function of the…
3 Citations
On Asymptotic Strategies for GMD Decoding with Arbitrary Error-Erasure Tradeoff
• Computer Science
• 2015
This work investigates different erasing strategies based on either erasing a fraction of the received symbols or erasing all symbols whose reliability values are below a certain threshold, using multi-trial GMD Forney’s decoder.
On multi-trial Forney-Kovalev decoding of concatenated codes
• Computer Science
Adv. Math. Commun.
• 2014
The optimal erasing strategy and the error correcting radii of both fixed and adaptive erasing decoders are given.
Zipper Codes: High-Rate Spatially-Coupled Codes with Algebraic Component Codes
Software simulation results show that adding erasure symbols improves the coding gain by around 0.1 dB with only a small increase in memory overhead and decoding complexity, and the types of stall patterns that can arise in zipper codes are analyzed.

## References

SHOWING 1-10 OF 14 REFERENCES
Reduced GMD decoding
• Computer Science
IEEE Trans. Inf. Theory
• 2003
The guaranteed error-correction radius and the unsuccessful decoding probability of this technique are studied and both known and new results, with applications to concatenated coding, follow from the unified approach presented in this correspondence.
Optimal threshold-based multi-trial error/erasure decoding with the Guruswami-Sudan algorithm
• Computer Science
2011 IEEE International Symposium on Information Theory Proceedings
• 2011
This work provides formulae which allow to optimally exploit the erasure option of decoders with arbitrary λ, if the decoder can be used z ≥ 1 times, and shows that BMD decoder with zBMD decoding trials can result in lower residual codeword error probability than Guruswami-Sudan (GS) list decodes with zGS trials, if z BMD is only slightly larger than zGS.
Optimal thresholds for GMD decoding with ℓ+1 over ℓ-extended Bounded Distance decoders
• Computer Science
2010 IEEE International Symposium on Information Theory
• 2010
The main contribution is a threshold location formula, which allows to optimally erase unreliable inner decoding results, for a given number of decoding trials and parameter ℓ, which means that the residual codeword error probability of the concatenated code is minimized.
On Extended Forney-Kovalev GMD decoding
• Computer Science
2009 IEEE International Symposium on Information Theory
• 2009
An m-trial generalized minimum distance (GMD) decoder based on λ is proposed, which extends results of Forney and Kovalev to the whole given range of λ.
Single-trial decoding of concatenated codes using fixed or adaptive erasing
• Computer Science
Adv. Math. Commun.
• 2010
A single-trial erasures-and-errors-correcting outer decoder is considered, that extends Kovalev's approach for the whole given range of $\lambda$.
Decoding of Reed Solomon Codes beyond the Error-Correction Bound
To the best of the knowledge, this is the first efficient (i.e., polynomial time bounded) algorithm which provides error recovery capability beyond the error-correction bound of a code for any efficient code.
Improved decoding of Reed-Solomon and algebraic-geometry codes
• Computer Science
IEEE Trans. Inf. Theory
• 1999
An improved list decoding algorithm for decoding Reed-Solomon codes and alternant codes and algebraic-geometry codes is presented and a solution to a weighted curve-fitting problem is presented, which may be of use in soft-decision decoding algorithms for Reed- Solomon codes.
Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs
• Computer Science
IEEE Transactions on Information Theory
• 2009
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.
Generalized minimum distance decoding
• G. Forney
• Computer Science
IEEE Trans. Inf. Theory
• 1966
A new distance measure is introduced which permits likelihood information to be used in algebraic minimum distance decoding techniques and an efficient decoding algorithm is given, and exponential bounds on the probability of not decoding correctly are developed.
Multitrial decoding of concatenated codes using fixed thresholds
• Computer Science
Probl. Inf. Transm.
• 2010
This work considers the case where the outer decoder is able to decode beyond half the minimum distance of the outer code, and derives achievable decoding radii for GMD decoding.