Multitrial decoding of concatenated codes using fixed thresholds

Authors:
C. Senger;V. R. Sidorenko;M. Bossert;V. V. Zyablov
Affiliations:
Ulm University, Ulm, Germany;Kharkevich Institute for Information Transmission Problems, RAS, Moscow, Russia;Ulm University, Ulm, Germany;Kharkevich Institute for Information Transmission Problems, RAS, Moscow, Russia
Venue:
Problems of Information Transmission
Year:
2010

Citing 6
Cited 1

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
Decoding of interleaved Reed Solomon codes over noisy data

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes

IEEE Transactions on Information Theory
Improved decoding of Reed-Solomon and algebraic-geometry codes

IEEE Transactions on Information Theory
Reduced GMD decoding

IEEE Transactions on Information Theory

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

Problems of Information Transmission

Quantified Score

Hi-index	0.00

Visualization

Abstract

For decoding concatenated codes up to half their designed distance, generalized minimum distance (GMD) decoding can be used. GMD decoding applies multitrial error/erasure decoding of the outer code, where erased symbols depend on some reliability measure stemming from the inner decoders. We consider the case where the outer decoder is able to decode beyond half the minimum distance of the outer code. For a given number of outer decoding trials, we derive achievable decoding radii for GMD decoding. Vice versa, we give a lower bound on the number of required outer decoding trials to obtain the greatest possible decoding radius.