Generalized minimum distance decoding

DOI10.1109/TIT.1966.1053873MaRDI QIDQ5668714zbMATH OpenOpenAlexFDO

Authors G. David jun. Forney

Publication date 1966

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

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

Mathematics Subject Classification ID

Information theory (general) (94A15) Theory of error-correcting codes and error-detecting codes (94B99)

Cited in

(8)

• Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff
• List decoding of number field codes
• On multi-trial Forney-Kovalev decoding of concatenated codes
• Soft decision decoding of Reed Solomon codes using the Dorsch algorithm
• Soft decoding of short/medium length codes using ordered statistics for quantum key distribution
• Subcodes of Reed-Solomon Codes Suitable for Soft Decoding
• Hardness amplification within NP against deterministic algorithms
• Algorithmizing the multiplicity Schwartz-Zippel lemma

This page was built for publication: Generalized minimum distance decoding

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