On the complexity of decoding Goppa codes (Corresp.)

DOI10.1109/TIT.1977.1055732zbMATH Open0362.94028MaRDI QIDQ4137084FDOQ4137084

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)

• The complexity of error-correcting codes
• Simplified High-Speed High-Distance List Decoding for Alternant Codes
• New techniques for the computation of linear recurrence coefficients
• DAGS: key encapsulation using dyadic GS 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)