Araştırma Makalesi
BibTex RIS Kaynak Göster

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

Yıl 2017, Cilt: 4 Sayı: 3, 235 - 246, 15.09.2017
https://doi.org/10.13069/jacodesmath.327368

Öz

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.

Kaynakça

  • [1] T. P. Berger, Goppa and related codes invariant under a prescribed permutation, IEEE Trans. Inform. Theory 46(7) (2000) 2628–2633.
  • [2] C. L. Chen, Equivalent irreducible Goppa codes, IEEE Trans. Inform. Theory 24(6) (1978) 766–769.
  • [3] H. Dinh, C. Moore, A. Russell, McEliece and Niederreiter cryptosystems that resist quantum Fourier sampling attacks, In: Rogaway P. (eds) Advances in Cryptology – CRYPTO 2011. CRYPTO 2011. Lecture Notes in Computer Science 6841 (2011) 761–779.
  • [4] I. M. Isaacs, Algebra: A Graduate Text, Brooks/Cole, Pacific Grove, 1994.
  • [5] R. Lidl, H. Niederreiter, Introduction to Finite Fields and Their Applications, Cambridge University Press, London, 1994.
  • [6] S. Ling, C. Xing, Coding Theory; A First Course, Cambridge University Press, United Kingdom, 2004.
  • [7] K. Magamba, J. A. Ryan, Counting irreducible polynomials of degree $r$ over $F_{q^n}$ and generating Goppa codes using the lattice of subfields of $F_{q^{nr}}$ , J. Discrete Math. 2014 (2014) 1–4.
  • [8] J. A. Ryan, Irreducible Goppa Codes, Ph.D. Dissertation, University College Cork, 2004.
  • [9] J. A. Ryan, A new connection between irreducible and extended irreducible Goppa codes, Proc. SAMSA (2012) 152–154.
  • [10] J. A. Ryan, Counting extended irreducible binary quartic Goppa codes of length $2^n+1$, IEEE Trans. Inform. Theory 61(3) (2015) 1174–1178.
Yıl 2017, Cilt: 4 Sayı: 3, 235 - 246, 15.09.2017
https://doi.org/10.13069/jacodesmath.327368

Öz

Kaynakça

  • [1] T. P. Berger, Goppa and related codes invariant under a prescribed permutation, IEEE Trans. Inform. Theory 46(7) (2000) 2628–2633.
  • [2] C. L. Chen, Equivalent irreducible Goppa codes, IEEE Trans. Inform. Theory 24(6) (1978) 766–769.
  • [3] H. Dinh, C. Moore, A. Russell, McEliece and Niederreiter cryptosystems that resist quantum Fourier sampling attacks, In: Rogaway P. (eds) Advances in Cryptology – CRYPTO 2011. CRYPTO 2011. Lecture Notes in Computer Science 6841 (2011) 761–779.
  • [4] I. M. Isaacs, Algebra: A Graduate Text, Brooks/Cole, Pacific Grove, 1994.
  • [5] R. Lidl, H. Niederreiter, Introduction to Finite Fields and Their Applications, Cambridge University Press, London, 1994.
  • [6] S. Ling, C. Xing, Coding Theory; A First Course, Cambridge University Press, United Kingdom, 2004.
  • [7] K. Magamba, J. A. Ryan, Counting irreducible polynomials of degree $r$ over $F_{q^n}$ and generating Goppa codes using the lattice of subfields of $F_{q^{nr}}$ , J. Discrete Math. 2014 (2014) 1–4.
  • [8] J. A. Ryan, Irreducible Goppa Codes, Ph.D. Dissertation, University College Cork, 2004.
  • [9] J. A. Ryan, A new connection between irreducible and extended irreducible Goppa codes, Proc. SAMSA (2012) 152–154.
  • [10] J. A. Ryan, Counting extended irreducible binary quartic Goppa codes of length $2^n+1$, IEEE Trans. Inform. Theory 61(3) (2015) 1174–1178.
Toplam 10 adet kaynakça vardır.

Ayrıntılar

Konular Mühendislik
Bölüm Makaleler
Yazarlar

Augustine İ. Musukwa Bu kişi benim 0000-0001-8792-6954

Kondwani Magamba Bu kişi benim 0000-0003-4025-9802

John A. Ryan Bu kişi benim

Yayımlanma Tarihi 15 Eylül 2017
Yayımlandığı Sayı Yıl 2017 Cilt: 4 Sayı: 3

Kaynak Göster

APA Musukwa, A. İ., 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
AMA Musukwa Aİ, 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. Eylül 2017;4(3):235-246. doi:10.13069/jacodesmath.327368
Chicago Musukwa, Augustine İ., Kondwani Magamba, ve John A. Ryan. “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, sy. 3 (Eylül 2017): 235-46. https://doi.org/10.13069/jacodesmath.327368.
EndNote Musukwa Aİ, Magamba K, Ryan JA (01 Eylül 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.
IEEE A. İ. Musukwa, K. Magamba, ve J. A. Ryan, “Enumeration of extended irreducible binary Goppa codes of degree $2^{m}$ and length $2^{n}+1$”, Journal of Algebra Combinatorics Discrete Structures and Applications, c. 4, sy. 3, ss. 235–246, 2017, doi: 10.13069/jacodesmath.327368.
ISNAD Musukwa, Augustine İ. vd. “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 (Eylül 2017), 235-246. https://doi.org/10.13069/jacodesmath.327368.
JAMA Musukwa Aİ, 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:235–246.
MLA Musukwa, Augustine İ. vd. “Enumeration of Extended Irreducible Binary Goppa Codes of Degree $2^{m}$ and Length $2^{n}+1$”. Journal of Algebra Combinatorics Discrete Structures and Applications, c. 4, sy. 3, 2017, ss. 235-46, doi:10.13069/jacodesmath.327368.
Vancouver Musukwa Aİ, 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-46.