EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Enumeration of extended irreducible binary Goppa codes of degree $2^{m}$ and length $2^{n}+1$

Augustine I. Musukwa, Kondwani Magamba, John A. Ryan

Journal of Algebra Combinatorics Discrete Structures and Applications · 15.09.2017 · 4 (3) · 235-246

DOI: 10.13069/jacodesmath.327368 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Algebra Combinatorics Discrete Structures and Applications, online erschienen am 15.09.2017. Verfasst von Augustine I. Musukwa und 2 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref). Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Let $n$ be an odd prime and $m>1$ be a positive integer. We produce an upper bound on the number of inequivalent extended irreducible binary Goppa codes of degree $2^{m}$ and length $2^{n}+1$. Some examples are given to illustrate our results.

Zitieren

APA

Musukwa, A. I., Magamba, K., & Ryan, J. A. (2017). Enumeration of extended irreducible binary Goppa codes of degree $2^{m}$ and length $2^{n}+1$. Journal of Algebra Combinatorics Discrete Structures and Applications, 4(3), 235-246. https://doi.org/10.13069/jacodesmath.327368

Vancouver

Musukwa AI, Magamba K, Ryan JA. Enumeration of extended irreducible binary Goppa codes of degree $2^{m}$ and length $2^{n}+1$. Journal of Algebra Combinatorics Discrete Structures and Applications. 2017;4(3):235-246. doi:10.13069/jacodesmath.327368

BibTeX
@article{Musukwa2017,
  author = {Musukwa, Augustine I. and Magamba, Kondwani and Ryan, John A.},
  title = {Enumeration of extended irreducible binary Goppa codes of degree $2^m$ and length $2^n+1$},
  journal = {Journal of Algebra Combinatorics Discrete Structures and Applications},
  year = {2017},
  volume = {4},
  number = {3},
  pages = {235--246},
  doi = {10.13069/jacodesmath.327368}
}
Kostenlos starten →