Abstract
Cyclic codes are a subclass of linear codes and are widely used in many applications as they have efficient encoding and decoding algorithms. In this paper, we investigate two classes of cyclic codes over \(\mathbb {F}_{q}\) with prime length using cyclotomy of order 4. Both the dimensions and the generator polynomials are explicitly determined. The method serves as a connection between cyclic codes and sequences over \(\mathbb {F}_{q}\) whose supports are the unions of certain cyclotomic classes of order 4. The main results thus partially answer two open problems in Ding (2015).
Similar content being viewed by others
References
Berndt, B.C., Evans, R.J., Williams, K.S.: Gauss and Jacobi Sums. Canadian Mathematical Society Series of Monographs and Advanced Texts. Wiley, New York (1998)
Betti, E., Sala, M.: A new bound for the minimum distance of a cyclic code from its defining set. IEEE Trans. Inform. Theory 52(8), 3700–3706 (2006)
Ding, C.: Cyclic codes from the two-prime sequences. IEEE Trans. Inform. Theory 58(6), 3881–3891 (2012)
Ding, C.: Cyclic codes from cyclotomic sequences of order four. Finite Fields Appl. 23, 8–34 (2013)
Ding, C.: Codes from Difference Sets. World Scientific (2015)
Ding, C., Li, C., Li, N., Zhou, Z.: Three-weight cyclic codes and their weight distributions. Discrete Math 339(2), 415–427 (2016)
Ding, C., Xiao, G., Shan, W.: The Stability Theory of Stream Ciphers, vol. 561. Springer Verlag (1991)
Ding, C., Yang, J.: Hamming weights in irreducible cyclic codes. Discrete Math. 313(4), 434–446 (2013)
Lehmer, E.: On residue difference sets. Canadian J. Math. 5, 425–432 (1953)
Pott, A.: On abelian difference set codes. Des. Codes Cryptogr. 2(3), 263–271 (1992)
Storer, T.: Cyclotomy and Difference Sets. Lectures in Advanced Mathematics, No. 2. Markham Publishing Co., Chicago (1967)
Wang, Q.: The linear complexity of some binary sequences with three-level autocorrelation. IEEE Trans. Inform. Theory 56(8), 4046–4052 (2010)
Wang, Q., Du, X.: The linear complexity of binary sequences with optimal autocorrelation. IEEE Trans. Inform. Theory 56(12), 6388–6397 (2010)
Xiang, Q.: Cyclotomy, Gauss sums, difference sets and strongly regular Cayley graphs. In: Sequences and their Applications—SETA 2012, Lecture Notes in Comput. Sci., vol. 7280, pp 245–256. Springer, Heidelberg (2012)
Zhou, Z., Ding, C.: A class of three-weight cyclic codes. Finite Fields Appl. 25, 79–93 (2014)
Acknowledgments
The author is grateful to the editor and two anonymous reviewers for careful reading and for many valuable comments that improved the quality of the paper. Q. Wang’s work was supported by the Shenzhen fundamental research programs under Grant no. JCYJ20150630145302234.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wang, Q. Some cyclic codes with prime length from cyclotomy of order 4. Cryptogr. Commun. 9, 85–92 (2017). https://doi.org/10.1007/s12095-016-0188-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12095-016-0188-3