Chase-type and GMD coset decoding

DOI10.1109/26.837034MaRDI QIDQ2732974zbMATH OpenOpenAlexFDO

Authors Marc Fossorier, Shu Lin

Publication date 4 September 2001

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/26.837034

zbMATH Keywords

soft-decision decodingblock codeGMD decodingChase decoding algorithmsdistance decoding

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Recommendations

• Asymptotic optimality of the GMD and Chase decoding algorithms
• Geometrical and performance analysis of GMD and Chase decoding algorithms
• Limited-trial chase decoding
• Generalization of chase algorithms for soft decision decoding of binary linear codes
• Limited-Trial Chase-Like Algorithms Achieving Bounded-Distance Decoding

Cited in

(8)

• Generalized coset decoding
• Generalization of chase algorithms for soft decision decoding of binary linear codes
• Asymptotic optimality of the GMD and Chase decoding algorithms
• Limited-trial chase decoding
• Limited-Trial Chase-Like Algorithms Achieving Bounded-Distance Decoding
• Fast Chase algorithm with an application in turbo decoding
• The search center of the Chase-like decoding algorithms
• The constructions of the minimum \(l\)-defeasible set

This page was built for publication: Chase-type and GMD coset decoding

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