Counting extended irreducible binary Goppa codes of degree 2p and length 2^n+1
Abstract
Let $n$ and $p$ be odd primes such that $p\neq n$ and $p\nmid(2^n \pm 1)$. An upper bound on the number of inequivalent extended irreducible binary Goppa codes of degree $2p$ and length $2^{n}+1$ is produced.
Copyright © 2017 Augustine Musukwa. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
A. Musukwa, Counting extended irreducible binary Goppa codes of degree 2p and length 2^n+1, J. Math. Comput. Sci. 8 (2018), 1–17.
BibTeX
@article{Musukwa2018,
author = {Musukwa, Augustine},
title = {Counting extended irreducible binary Goppa codes of degree 2p and length 2^n+1},
journal = {J. Math. Comput. Sci.},
volume = {8},
year = {2018},
pages = {1--17},
doi = {}
}