Counting Extended Irreducible Binary Quartic Goppa Codes of Length &lt;inline-formula&gt; &lt;tex-math notation="LaTeX"&gt;$2^{n}+1$ &lt;/tex-math&gt;&lt;/inline-formula&gt;

Counting Extended Irreducible Binary Quartic Goppa Codes of Length <inline-formula> <tex-math notation="LaTeX">$2^{n}+1$ </tex-math></inline-formula>

John A Ryan

https://doi.org/10.1109/tit.2015.2389246

Copy DOI

Journal: IEEE Transactions on Information Theory	Publication Date: Mar 1, 2015
Citations: 5

We produce an upper bound on the number of extended irreducible binary quartic Goppa codes of length 2 n +1, where n > 3 is a prime number.

Full Text

Published version (

Free)

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Paper Title

Journal

Date

Author