Further results on Goppa codes and their applications to constructing efficient binary codes
From MaRDI portal
Publication:4128435
DOI10.1109/TIT.1976.1055610zbMATH Open0356.94056MaRDI QIDQ4128435FDOQ4128435
Authors: Yasuo Sugiyama, Masao Kasahara, Shigeichi Hirasawa, Toshihiko Namekawa 
Publication date: 1976
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Cited In (14)
- Improving the minimum distance bound of trace Goppa codes
- Totally decomposed cumulative Goppa codes with improved estimations
- Note on the dimension of Goppa codes
- New identities relating wild Goppa codes
- Simplified High-Speed High-Distance List Decoding for Alternant Codes
- New binary codes from extended Goppa codes
- Algorithms for simultaneous Hermite-Padé approximations
- List Decoding for Binary Goppa Codes
- Wild McEliece
- Wild McEliece Incognito
- Codes and the Cartier operator
- The BCH-Goppa decoding as a moment problem and a tau function over finite fields.
- Galois hulls of special Goppa codes and related codes with application to EAQECCs
- New bounds on the distance distribution of extended Goppa codes
This page was built for publication: Further results on Goppa codes and their applications to constructing efficient binary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4128435)
