Abstract
The purpose of this work is to use an already known identity among the weight enumerator polynomials, in order to present an improved method for determining the weight distribution of a family of q-ary reducible cyclic codes, that generalize, in an easier way, the results in Yu and Liu (Des Codes Cryptogr 78:731–745, 2016).
Similar content being viewed by others
References
Helleseth, T., Kholosha, A.: Monomial and quadratic bent functions over the finite fields of odd characteristic. IEEE Trans. Inf. Theory 52(5), 2018–2032 (2006)
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)
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)
Vega, G.: Determining the number of one-weight cyclic codes when length and dimension are given. Lect. Notes Comput. Sci. 4547, 284–293 (2007)
Vega, G.: A critical review and some remarks about one- and two-weight irreducible cyclic codes. Finite Fields Their Appl. 51(33), 1–13 (2015)
Yu, L., Liu, H.: The weight distribution of a family of \(p\)-ary cyclic codes. Des. Codes Cryptogr. 78, 731–745 (2016)
Acknowledgements
The author want to express his gratitude to the anonymous referees for their valuable comments. Particularly, the author wants to thank to one of the reviewers for his/her almost direct and elegant proof of Theorem 3.
Author information
Authors and Affiliations
Corresponding author
Additional information
Partially supported by PAPIIT-UNAM IN107515.
Rights and permissions
About this article
Cite this article
Vega, G. An improved method for determining the weight distribution of a family of q-ary cyclic codes. AAECC 28, 527–533 (2017). https://doi.org/10.1007/s00200-017-0318-y
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00200-017-0318-y