Multitrial decoding of concatenated codes using fixed thresholds

DOI10.1134/S0032946010020031zbMath1237.94141MaRDI QIDQ415715

Vladimir Sidorenko, Christian Senger, Martin Bossert, Victor Zyablov

Publication date: 9 May 2012

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

Mathematics Subject Classification ID

Other types of codes (94B60) Decoding (94B35)

Related Items (2)

Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff ⋮ On multi-trial Forney-Kovalev decoding of concatenated codes

Cites Work

• Unnamed Item
• Unnamed Item
• Single-trial decoding of concatenated codes using fixed or adaptive erasing
• On multi-trial Forney-Kovalev decoding of concatenated codes
• A new Reed-Solomon code decoding algorithm based on Newton's interpolation
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Reduced GMD decoding
• Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes
• Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs

This page was built for publication: Multitrial decoding of concatenated codes using fixed thresholds