Skip to main content
Erschienen in: Designs, Codes and Cryptography 3/2016

01.03.2016

Weight enumerator of some irreducible cyclic codes

verfasst von: Fabio Enrique Brochero Martínez, Carmen Rosa Giraldo Vergara

Erschienen in: Designs, Codes and Cryptography | Ausgabe 3/2016

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this article, we show explicitly all possible weight enumerators for every irreducible cyclic code of length \(n\) over a finite field \({\mathbb {F}}_q\), in the case which each prime divisor of \(n\) is also a divisor of \(q-1\).
Literatur
1.
Zurück zum Zitat Brochero Martínez F.E., Giraldo Vergara C.R., Batista de Oliveira L.: Explicit factorization of \(x^{n}-1\in {\mathbb{F}}_q[x]\). Des. Codes Cryptogr. (Accepted). Brochero Martínez F.E., Giraldo Vergara C.R., Batista de Oliveira L.: Explicit factorization of \(x^{n}-1\in {\mathbb{F}}_q[x]\). Des. Codes Cryptogr. (Accepted).
2.
Zurück zum Zitat Chen B., Li L., Tuerhong R.: Explicit factorization of \(x^{2^mp^n}-1 \) over a finite field. Finite Fields Appl. 24, 95–104 (2013). Chen B., Li L., Tuerhong R.: Explicit factorization of \(x^{2^mp^n}-1 \) over a finite field. Finite Fields Appl. 24, 95–104 (2013).
3.
Zurück zum Zitat Ding C.: The weight distribution of some irreducible cyclic codes. IEEE Trans. Inf. Theory 55, 955–960 (2009). Ding C.: The weight distribution of some irreducible cyclic codes. IEEE Trans. Inf. Theory 55, 955–960 (2009).
4.
Zurück zum Zitat Ding C., Yang J.: Hamming weights in irreducible cyclic codes. Discret. Math. 313, 434–446 (2013). Ding C., Yang J.: Hamming weights in irreducible cyclic codes. Discret. Math. 313, 434–446 (2013).
5.
Zurück zum Zitat Farrell P.G., Castieira Moreira J.: Essentials of Error-Control Coding. Wiley, Hoboken (2006). Farrell P.G., Castieira Moreira J.: Essentials of Error-Control Coding. Wiley, Hoboken (2006).
6.
Zurück zum Zitat Fitzgerald R.W., Yucas J.L.: Explicit factorization of cyclotomic and Dickson polynomials over finite fields. In Arithmetic of Finite Fields. Lecture Notes in Computer Science, vol. 4547, pp. 1–10. Springer, Berlin (2007). Fitzgerald R.W., Yucas J.L.: Explicit factorization of cyclotomic and Dickson polynomials over finite fields. In Arithmetic of Finite Fields. Lecture Notes in Computer Science, vol. 4547, pp. 1–10. Springer, Berlin (2007).
7.
Zurück zum Zitat Golay M.J.E.: Notes on digital coding. Proc. IRE 37, 657 (1949). Golay M.J.E.: Notes on digital coding. Proc. IRE 37, 657 (1949).
8.
Zurück zum Zitat Lidl R., Niederreiter H.: Finite Fields. Encyclopedia of Mathematics and Its Applications, vol. 20. Addison-Wesley, Boston (1983). Lidl R., Niederreiter H.: Finite Fields. Encyclopedia of Mathematics and Its Applications, vol. 20. Addison-Wesley, Boston (1983).
9.
Zurück zum Zitat Meyn H.: Factorization of the cyclotomic polynomials \(x^{2^n}+1\) over finite fields. Finite Fields Appl. 2, 439–442 (1996). Meyn H.: Factorization of the cyclotomic polynomials \(x^{2^n}+1\) over finite fields. Finite Fields Appl. 2, 439–442 (1996).
10.
Zurück zum Zitat Sharma A., Bakshi G.: The weight distribution of some irreducible cyclic codes. Finite Fields Appl. 18, 144–159 (2012). Sharma A., Bakshi G.: The weight distribution of some irreducible cyclic codes. Finite Fields Appl. 18, 144–159 (2012).
11.
Zurück zum Zitat Wang L., Wang Q.: On explicit factors of cyclotomic polynomials over finite fields. Des. Codes Cryptogr. 63(1), 87–104 (2012). Wang L., Wang Q.: On explicit factors of cyclotomic polynomials over finite fields. Des. Codes Cryptogr. 63(1), 87–104 (2012).
Metadaten
Titel
Weight enumerator of some irreducible cyclic codes
verfasst von
Fabio Enrique Brochero Martínez
Carmen Rosa Giraldo Vergara
Publikationsdatum
01.03.2016
Verlag
Springer US
Erschienen in
Designs, Codes and Cryptography / Ausgabe 3/2016
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-014-0026-6

Weitere Artikel der Ausgabe 3/2016

Designs, Codes and Cryptography 3/2016 Zur Ausgabe