Limited-Trial Chase-Like Algorithms Achieving Bounded-Distance Decoding

DOI10.1109/TIT.2004.838103zbMATH Open1319.94102OpenAlexW2153033939MaRDI QIDQ3547788FDOQ3547788

Authors: J. H. Weber, Marc Fossorier 

Publication date: 21 December 2008

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

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

Recommendations

• Limited-trial chase decoding
• On algebraic soft-decision decoding algorithms for BCH codes
• Chase-type and GMD coset decoding
• Geometrical and performance analysis of GMD and Chase decoding algorithms
• Generalization of chase algorithms for soft decision decoding of binary linear codes

zbMATH Keywords

Hamming distanceChase decoding algorithmsbounded-distance (BD) decodingcomplete Euclidean distance decodererror-correcting block codeerror-correction radiussoft-decision decoder

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Linear codes (general theory) (94B05)

Cited In (8)

• Chase-type and GMD 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
• On algebraic soft-decision decoding algorithms for BCH codes
• The search center of the Chase-like decoding algorithms
• The constructions of the minimum \(l\)-defeasible set
• Title not available (Why is that?)

This page was built for publication: Limited-Trial Chase-Like Algorithms Achieving Bounded-Distance Decoding

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