On the complexity of decoding Goppa codes (Corresp.)

DOI10.1109/TIT.1977.1055732MaRDI QIDQ4137084zbMATH OpenFDO

Authors Dilip V. Sarwate

Publication date 1977

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

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)

Cited in

(4)

• DAGS: key encapsulation using dyadic GS codes
• The complexity of error-correcting codes
• New techniques for the computation of linear recurrence coefficients
• Simplified High-Speed High-Distance List Decoding for Alternant Codes

This page was built for publication: On the complexity of decoding Goppa codes (Corresp.)

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