Abstract
Reducible cyclic codes with exactly two nonzero weights were first studied by T. Helleseth [4] and J. Wolfmann [15]. Later on, G. Vega [11], set forth the sufficient numerical conditions in order that a cyclic code, constructed as the direct sum of two one-weight cyclic codes, has exactly two nonzero weights, and conjectured that there are no other reducible two-weight cyclic codes of this type. In this paper we present a new class of cyclic codes constructed as the direct sum of two one-weight cyclic codes. As will be shown, this new class of cyclic codes is in accordance with the previous conjecture, since its codes have exactly six nonzero weights. In fact, for these codes, we will also give their full weight distribution, showing that none of them can be projective. On the other hand, recently, a family of six-weight reducible cyclic codes and their weight distribution, was presented by Y. Liu, et al. [7]; however it is worth noting that, unlike what is done here, the codes in such family are constructed as the direct sum of three irreducible cyclic codes.
Partially supported by PAPIIT-UNAM IN107515.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baumert, L., Mills, W., Ward, R.: Uniform cyclotomy. J. Number Theory 14(1), 67–82 (1982)
Delsarte, P.: On subfield subcodes of Reed-Solomon codes. IEEE Trans. Inform. Theory 5, 575–576 (1975)
Ding, C., Liu, Y., Ma, C., Zeng, L.: The weight distributions of the duals of cyclic codes with two zeros. IEEE Trans. Inform. Theory 57(12), 8000–8006 (2011)
Helleseth, T.: Some two-weight codes with composite parity-check polynomials. IEEE Trans. Inform. Theory 22, 631–632 (1976)
Huffman, W.C., Pless, V.S.: Fundamental of Error-Correcting Codes. Cambridge Univ. Press, Cambridge (2003)
Lidl, R., Niederreiter, H.: Finite Fields. Cambridge Univ. Press, Cambridge (1983)
Liu, Y., Yan, H., Liu, C.: A class of six-weight cyclic codes and their weight distribution. Des. Codes Cryptogr. (published online June 4, 2014) doi:10.1007/s10623-014-9984-y
Ma, C., Zeng, L., Liu, Y., Feng, D., Ding, C.: The Weight Enumerator of a Class of Cyclic Codes. IEEE Trans. Inf. Theory 57(1), 397–402 (2011)
Moisio, M.: A note on evaluations of some exponential sums. Acta Arith 93, 117–119 (2000)
Vega, G.: Determining the number of one-weight cyclic codes when length and dimension are given. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol. 4547, pp. 284–293. Springer, Heidelberg (2007)
Vega, G.: Two-weight cyclic codes constructed as the direct sum of two one-weight cyclic codes. Finite Fields Appl. 14(3), 785–797 (2008)
Vega, G.: A General Description for the Weight Distribution of Some Reducible Cyclic Codes. IEEE Trans. Inform. Theory 59(9), 5994–6001 (2013)
Vega, G.: A critical review and some remarks about one- and two-weight irreducible cyclic codes. Finite Fields Appl. 33, 1–13 (2015)
Wang, B., Tang, C., Qi, Y., Yang, Y., Xu, M.: The weight distributions of cyclic codes and elliptic curves. IEEE Trans. Inform. Theory 58(12), 7253–7259 (2012)
Wolfmann, J.: Are 2-Weight Projective Cyclic Codes Irreducible? IEEE Trans. Inform. Theory 51(2), 733–737 (2005)
Xiong, M.: The weight distributions of a class of cyclic codes. Finite Fields Appl. 18(5), 933–945 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Vega, G. (2015). A Family of Six-Weight Reducible Cyclic Codes and their Weight Distribution. In: El Hajji, S., Nitaj, A., Carlet, C., Souidi, E. (eds) Codes, Cryptology, and Information Security. C2SI 2015. Lecture Notes in Computer Science(), vol 9084. Springer, Cham. https://doi.org/10.1007/978-3-319-18681-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-18681-8_15
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18680-1
Online ISBN: 978-3-319-18681-8
eBook Packages: Computer ScienceComputer Science (R0)