On the complexity of decoding Goppa codes (Corresp.)
From MaRDI portal
Publication:4137084
DOI10.1109/TIT.1977.1055732zbMath0362.94028MaRDI QIDQ4137084
Publication date: 1977
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (4)
The complexity of error-correcting codes ⋮ New techniques for the computation of linear recurrence coefficients ⋮ DAGS: key encapsulation using dyadic GS codes ⋮ Simplified High-Speed High-Distance List Decoding for Alternant Codes
This page was built for publication: On the complexity of decoding Goppa codes (Corresp.)