Geometrical and performance analysis of GMD and Chase decoding algorithms

DOI10.1109/18.771143MaRDI QIDQ4701402zbMATH OpenOpenAlexFDO

Authors Eran Fishler, Ofer Amrani, Yair Be'ery

Publication date 21 November 1999

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/542d22819434b08bb3bfba53f1c27c2779e24835

zbMATH Keywords

bounded distance decodingChase decoding algorithmsdecision regionnearest neighborsvolume ratio

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35) Error probability in coding theory (94B70)

Recommendations

• Asymptotic optimality of the GMD and Chase decoding algorithms
• Chase-type and GMD coset decoding
• On algebraic soft-decision decoding algorithms for BCH codes
• Limited-Trial Chase-Like Algorithms Achieving Bounded-Distance Decoding
• Error performance analysis for reliability-based decoding algorithms

Cited in

(7)

• Chase-type and GMD coset decoding
• A bounded-distance decoding algorithm for binary linear block codes achieving the minimum effective error coefficient
• Limited-trial chase decoding
• Limited-Trial Chase-Like Algorithms Achieving Bounded-Distance Decoding
• Error performance analysis for reliability-based decoding algorithms
• Asymptotic optimality of the GMD and Chase decoding algorithms
• Bounded-distance decoding: algorithms, decision regions, and pseudo nearest neighbors

This page was built for publication: Geometrical and performance analysis of GMD and Chase decoding algorithms

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