Generalized minimum distance decoding in Euclidean space: performance analysis

DOI10.1109/18.817509MaRDI QIDQ4503500zbMATH OpenOpenAlexFDO

Authors Dakshi Agrawal, Alexander Vardy

Publication date 7 September 2000

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

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

zbMATH Keywords

Euclidean-space codesgeneralized minimum distance decodingmultilevel codesmultistage decoding

Mathematics Subject Classification ID

Decoding (94B35) Other types of codes (94B60) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• Generalized minimum-distance decoding of Euclidean-space codes and lattices
• Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes
• scientific article; zbMATH DE number 4112538
• scientific article; zbMATH DE number 4104869
• An improvement to generalized-minimum-distance decoding

Cited in

(7)

• List-decoding Barnes-Wall lattices
• Generalized minimum-distance decoding of Euclidean-space codes and lattices
• An improvement to generalized-minimum-distance decoding
• scientific article; zbMATH DE number 4104869 (Why is no real title available?)
• scientific article; zbMATH DE number 4112538 (Why is no real title available?)
• Generalized minimum distance decoding algorithms for Qary output channels (Corresp.)
• Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization

This page was built for publication: Generalized minimum distance decoding in Euclidean space: performance analysis

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