An improvement to generalized-minimum-distance decoding

DOI10.1109/18.61132MaRDI QIDQ3197765zbMATH OpenOpenAlexFDO

Authors Dana J. Taipale, Michael B. Pursley

Publication date 1991

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

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

zbMATH Keywords

codeworderror-correcting codeserrors-and-erasures decodinggeneralized-minimum-distance decodingsoft- decision decoding algorithm

Mathematics Subject Classification ID

Decoding (94B35)

Recommendations

• scientific article; zbMATH DE number 4112538
• scientific article; zbMATH DE number 4104869
• Reduced GMD decoding
• Generalized minimum distance decoding in Euclidean space: performance analysis
• Asymptotic optimality of the GMD and Chase decoding algorithms

Cited in

(11)

• Improvement on minimum distance of symbol-pair codes
• Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff
• Generalized minimum-distance decoding of Euclidean-space codes and lattices
• 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.)
• scientific article; zbMATH DE number 1047549 (Why is no real title available?)
• Generalized minimum distance decoding in Euclidean space: performance analysis
• Improving the generalized likelihood ratio test for unknown linear gaussian channels
• Reduced GMD decoding
• Improving the minimum distance bound of trace Goppa codes

This page was built for publication: An improvement to generalized-minimum-distance decoding

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