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

Authors:
J. H. Weber;V. R. Sidorenko;C. Senger;K. A. Abdel-Ghaffar
Affiliations:
Delft University of Technology, Delft, The Netherlands;Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia and Ulm University, Ulm, Germany;Ulm University, Ulm, Germany;University of California, Davis, USA
Venue:
Problems of Information Transmission
Year:
2012

Citing 7
Cited 0

Decoding of Reed Solomon codes beyond the error-correction bound

Journal of Complexity
Collaborative decoding of interleaved Reed-Solomon codes and concatenated code designs

IEEE Transactions on Information Theory
On extended Fomey-Kovalev GMD decoding

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Multitrial decoding of concatenated codes using fixed thresholds

Problems of Information Transmission
Improved decoding of Reed-Solomon and algebraic-geometry codes

IEEE Transactions on Information Theory
Generalized minimum distance decoding

IEEE Transactions on Information Theory
Reduced GMD decoding

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 channel output. Adaptive erasing based on a threshold is a new technique that has not been investigated before. An asymptotic approach is used to evaluate the error-correction radius for each strategy. Both known and new results appear as special cases of this general framework.