Multitrial decoding of concatenated codes using fixed thresholds

DOI10.1134/S0032946010020031MaRDI QIDQ415715zbMATH OpenFDO

Authors V. R. Sidorenko, Christian Senger, Martin Bossert, V. V. Zyablov

Publication date 9 May 2012

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

Mathematics Subject Classification ID

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

Recommendations

• Reduced GMD decoding
• On multi-trial Forney-Kovalev decoding of concatenated codes
• Single-trial decoding of concatenated codes using fixed or adaptive erasing
• scientific article; zbMATH DE number 4112538
• On decoding concatenated codes

Cites work

• scientific article; zbMATH DE number 3511981 (Why is no real title available?)
• scientific article; zbMATH DE number 2038702 (Why is no real title available?)
• A new Reed-Solomon code decoding algorithm based on Newton's interpolation
• Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs
• Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• On multi-trial Forney-Kovalev decoding of concatenated codes
• Reduced GMD decoding
• Single-trial decoding of concatenated codes using fixed or adaptive erasing

Cited in

(6)

• Reduced GMD decoding
• The performance of concatenated schemes based on non-binary multithreshold decoders
• Single-trial decoding of concatenated codes using fixed or adaptive erasing
• On multi-trial Forney-Kovalev decoding of concatenated codes
• Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff
• On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415715)