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

DOI10.1134/S0032946012040023zbMath1312.94121OpenAlexW2155466976MaRDI QIDQ1945143

Khaled A. S. Abdel-Ghaffar, J. H. Weber, Vladimir Sidorenko, Christian Senger

Publication date: 3 April 2013

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946012040023

Mathematics Subject Classification ID

Decoding (94B35)

Related Items (1)

On multi-trial Forney-Kovalev decoding of concatenated codes

Cites Work

• Multitrial decoding of concatenated codes using fixed thresholds
• Single-trial decoding of concatenated codes using fixed or adaptive erasing
• Decoding of Reed Solomon codes beyond the error-correction bound
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Reduced GMD decoding
• Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs
• Generalized minimum distance decoding

This page was built for publication: Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff