Abstract
A classification that shows explicitly all possible weight enumerator polynomials for every irreducible cyclic code of length n over a finite field \(\mathbb {F}_q\), in the particular case where each prime divisor of n is also a divisor of \(q-1\), was recently given in Brochero Martínez and Giraldo Vergara (Des Codes Cryptogr 78:703–712, 2016). However, as we will see next, such classification is incomplete. Thus, the purpose of this work is to use an already known identity among the weight enumerator polynomials, in order to complete such classification. As we will see later, by means of this identity, we not only complete, in an easier way, this classification, but we also find out the nature of the weight distributions of the class of irreducible cyclic codes studied in Brochero Martínez and Giraldo Vergara (2016).
Similar content being viewed by others
References
Brochero Martínez F.E., Giraldo Vergara C.R.: Weight enumerator of some irreducible cyclic codes. Des. Codes Cryptogr. 78, 703–712 (2016).
Delsarte P.: On subfield subcodes of Reed–Solomon codes. IEEE Trans. Inf. Theory 5, 575–576 (1975).
Helleseth T., Kløve T., Mykkeltveit J.: The weight distribution of irreducible cyclic codes with block lengths \(n_1((q^l-1)N)\). Discrete Math. 18(2), 179–211 (1977).
Kløve T.: The weight distribution for a class of irreducible cyclic codes. Discrete Math. 20, 87–90 (1977).
Lidl R., Niederreiter H.: Finite Fields. Cambridge University Press, Cambridge (1983).
Vega G.: Determining the number of one-weight cyclic codes when length and dimension are given. In: Lecture Notes in Computer Science, vol. 4547, pp. 284–293 (2007)
Vega G.: A critical review and some remarks about one- and two-weight irreducible cyclic codes. Finite Fields Appl. 51(33), 1–13 (2015).
Acknowledgements
The author want to express his gratitude to the anonymous referees for their valuable suggestions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by I. Landjev.
Partially supported by PAPIIT-UNAM IN107515.
Rights and permissions
About this article
Cite this article
Vega, G. A correction on the determination of the weight enumerator polynomial of some irreducible cyclic codes. Des. Codes Cryptogr. 86, 835–840 (2018). https://doi.org/10.1007/s10623-017-0364-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-017-0364-2