A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm

DOI10.1109/TIT.1985.1057038MaRDI QIDQ3713995zbMATH OpenFDO

Authors Lev B. Levitin, Carlos R. P. Hartmann

Publication date 1985

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

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

zbMATH Keywords

decoding algorithmsMDD

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35)

Recommendations

• The zero-guards algorithm for general minimum-distance decoding problems
• scientific article; zbMATH DE number 2077078
• A New Decoding Algorithm for Complete Decoding of Linear Block Codes
• Two classes of minimum generalized distance decoding algorithms
• Generalized minimum distance decoding algorithms for Qary output channels (Corresp.)

Cited in

(5)

• New approaches to reduced-complexity decoding
• Two classes of minimum generalized distance decoding algorithms
• A New Decoding Algorithm for Complete Decoding of Linear Block Codes
• The zero-guards algorithm for general minimum-distance decoding problems
• scientific article; zbMATH DE number 2077078 (Why is no real title available?)

This page was built for publication: A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm

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