Counting Extended Irreducible Binary Quartic Goppa Codes of Length <inline-formula> <tex-math notation="LaTeX">$2^{n}+1$ </tex-math></inline-formula>
From MaRDI portal
Publication:2978723
DOI10.1109/TIT.2015.2389246zbMath1359.94914MaRDI QIDQ2978723
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (3)
Unnamed Item ⋮ Upper bound on the number of inequivalent extended binary irreducible Goppa codes ⋮ Counting extended irreducible Goppa codes
This page was built for publication: Counting Extended Irreducible Binary Quartic Goppa Codes of Length <inline-formula> <tex-math notation="LaTeX">$2^{n}+1$ </tex-math></inline-formula>
