Bounded-distance decoding: algorithms, decision regions, and pseudo nearest neighbors

DOI10.1109/18.737536MaRDI QIDQ4701231zbMATH OpenOpenAlexFDO

Authors 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://doi.org/10.1109/18.737536

zbMATH Keywords

nearest neighborsVoronoi regiondecision regionbounded-distance decoding

Mathematics Subject Classification ID

Decoding (94B35)

Recommendations

• Geometrical and performance analysis of GMD and Chase decoding algorithms
• A bounded-distance decoding algorithm for binary linear block codes achieving the minimum effective error coefficient
• Limited-Trial Chase-Like Algorithms Achieving Bounded-Distance Decoding
• scientific article; zbMATH DE number 2077078
• scientific article; zbMATH DE number 820512

Cited in

(1)

• Reed-Muller codes and Barnes-Wall lattices: generalized multilevel constructions and representation over \(\mathrm{GF}(2^q)\)

This page was built for publication: Bounded-distance decoding: algorithms, decision regions, and pseudo nearest neighbors

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