Decoding Square-Free Goppa Codes Over \BBF_{p}
From MaRDI portal
Publication:5346328
DOI10.1109/TIT.2013.2270272zbMATH Open1364.94703OpenAlexW1528178759MaRDI QIDQ5346328FDOQ5346328
Authors: Paulo S. L. M. Barreto, Rafael Misoczki, Richard Lindner
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2013.2270272
Cited In (5)
- Simplified High-Speed High-Distance List Decoding for Alternant Codes
- On decoding algorithms for Goppa codes
- Statistical Decoding of Codes over $\mathbb{F}_q$
- Guruswami-Sudan Decoding of Elliptic Codes Through Module Basis Reduction
- On the dimension and structure of the square of the dual of a Goppa code
This page was built for publication: Decoding Square-Free Goppa Codes Over $\BBF_{p}$
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346328)