# American Institute of Mathematical Sciences

November  2016, 10(4): 707-723. doi: 10.3934/amc.2016036

## Cyclic codes from two-prime generalized cyclotomic sequences of order 6

 1 College of Sciences, China University of Petroleum, 66 Changjiang Xilu, Qingdao, Shandong 266580 2 College of Science, China University of Petroleum, Qingdao, Shandong 266580, China

Received  July 2014 Published  November 2016

Cyclic codes have wide applications in data storage systems and communication systems. Employing binary two-prime Whiteman generalized cyclotomic sequences of order 6, we construct several classes of cyclic codes over the finite field $\mathrm{GF}(q)$ and give their generator polynomials. And we also calculate the minimum distance of some cyclic codes and give lower bounds on the minimum distance for some other cyclic codes.
Citation: Tongjiang Yan, Yanyan Liu, Yuhua Sun. Cyclic codes from two-prime generalized cyclotomic sequences of order 6. Advances in Mathematics of Communications, 2016, 10 (4) : 707-723. doi: 10.3934/amc.2016036
##### References:
 [1] E. Betti and M. Sala, A new bound for the minimum distance of a cyclic code from its defining set, IEEE Trans. Inform. Theory, 52 (2006), 3700-3706. doi: 10.1109/TIT.2006.876240. [2] Z. Chen and X. Du, Linear complexity and autocorrelation values of a polyphase generalized cyclotomic sequence of length $pq$, Front. Computer Sci. China, 4 (2010), 529-535. [3] T. Cusick, C. Ding and A. Renvall, Stream ciphers and number theory, North-Holland Math. Library, 55 (2004), 198-212. [4] C. Ding, Cyclic codes from APN and planar functions, preprint, arXiv:1206.4687 [5] C. Ding, Cyclic codes from cyclotomic sequences of order four, Finite Fields Appl., 23 (2012), 8-34. doi: 10.1016/j.ffa.2013.03.006. [6] C. Ding, Cyclic codes from dickson polynomials, preprint, arXiv:1206.4370 [7] C. Ding, Cyclic codes from the two-prime sequences, IEEE Trans. Inform. Theory, 58 (2012), 3881-3891. doi: 10.1109/TIT.2012.2189549. [8] C. Ding, Cyclotomic constructions of cyclic codes with length being the product of two primes, IEEE Trans. Inform. Theory, 58 (2012), 2231-2236. doi: 10.1109/TIT.2011.2176915. [9] C. Ding and S. Ling, A $q$-polynomial approach to cyclic codes, Finite Fields Appl., 20 (2013), 1-14. doi: 10.1016/j.ffa.2012.12.005. [10] C. Ding, Y. Liu and L. Zeng, The weight distributions of the duals of cyclic codes with two zeros, IEEE Trans. Inform. Theory, 57 (2011), 8000-8006. doi: 10.1109/TIT.2011.2165314. [11] C. Ding and J. Yang, Hamming weights in irreducible cyclic codes, IEEE Trans. Inform. Theory, 313 (2013), 434-446. doi: 10.1016/j.disc.2012.11.009. [12] M. van Eupen and J. H. van Lint, On the minimum distance of ternary cyclic codes, IEEE Trans. Inform. Theory, 39 (1993), 409-422. doi: 10.1109/18.212272. [13] W. C. Huffman and V. Pless, Fundamentals of Error-Correcting Codes, Cambridge Univ. Press, Cambridge, 2003. doi: 10.1017/CBO9780511807077. [14] J. H. van Lint and R. M. Wilson, On the minimum distance of cyclic codes, IEEE Trans. Inform. Theory, 32 (1986), 23-40. doi: 10.1109/TIT.1986.1057134. [15] C. Ma, L. Zeng and Y. Liu et al., The weight enumerator of a class of cyclic codes, IEEE Trans. Inform. Theory, 57 (2011), 397-402. doi: 10.1109/TIT.2010.2090272. [16] Y. Sun, T. Yan and H. Li, Cyclic code from the first class Whiteman's generalized cyclotomic sequence with order 4, preprint, arXiv:1303.6378 [17] A. L. Whiteman, A family of difference sets, Illinois J. Math., 6 (1962) 107-121. [18] T. Yan, X. Du, G. Xiao and X. Huang, Linear complexity of binary Whiteman generalized cyclotomic sequences of order $2k$, Inform. Sci., 179 (2009), 1019-1023. doi: 10.1016/j.ins.2008.11.006. [19] T. Yan, B. Huang and G. Xiao, Cryptographic properties of some binary generalized cyclotomic sequences with the length $p^2$, Inform. Sci., 178 (2008), 1078-1086. doi: 10.1016/j.ins.2007.02.040. [20] J. Yang, M. Xiong and C. Ding, Weight distribution of a class of cyclic codes with arbitrary number of zeros, IEEE Trans. Inform. Theory, 9 (2013), 5985-5993. doi: 10.1109/TIT.2013.2266731. [21] Z. Zhou and C. Ding, A class of three-weight cyclic codes, Finite Fields Appl., 25 (2014), 79-93. doi: 10.1016/j.ffa.2013.08.005. [22] Z. Zhou, C. Ding, J. Luo and A. Zhang, A family of five-weight cyclic codes and their weight enumerators, IEEE Trans. Inform. Theory, 10 (2013), 6674-6682. doi: 10.1109/TIT.2013.2267722. [23] Z. Zhou, A. Zhang and C. Ding, The weight enumerator of three families of cyclic codes, IEEE Trans. Inform. Theory, 9 (2013), 6002-6009. doi: 10.1109/TIT.2013.2262095.

show all references

##### References:
 [1] E. Betti and M. Sala, A new bound for the minimum distance of a cyclic code from its defining set, IEEE Trans. Inform. Theory, 52 (2006), 3700-3706. doi: 10.1109/TIT.2006.876240. [2] Z. Chen and X. Du, Linear complexity and autocorrelation values of a polyphase generalized cyclotomic sequence of length $pq$, Front. Computer Sci. China, 4 (2010), 529-535. [3] T. Cusick, C. Ding and A. Renvall, Stream ciphers and number theory, North-Holland Math. Library, 55 (2004), 198-212. [4] C. Ding, Cyclic codes from APN and planar functions, preprint, arXiv:1206.4687 [5] C. Ding, Cyclic codes from cyclotomic sequences of order four, Finite Fields Appl., 23 (2012), 8-34. doi: 10.1016/j.ffa.2013.03.006. [6] C. Ding, Cyclic codes from dickson polynomials, preprint, arXiv:1206.4370 [7] C. Ding, Cyclic codes from the two-prime sequences, IEEE Trans. Inform. Theory, 58 (2012), 3881-3891. doi: 10.1109/TIT.2012.2189549. [8] C. Ding, Cyclotomic constructions of cyclic codes with length being the product of two primes, IEEE Trans. Inform. Theory, 58 (2012), 2231-2236. doi: 10.1109/TIT.2011.2176915. [9] C. Ding and S. Ling, A $q$-polynomial approach to cyclic codes, Finite Fields Appl., 20 (2013), 1-14. doi: 10.1016/j.ffa.2012.12.005. [10] C. Ding, Y. Liu and L. Zeng, The weight distributions of the duals of cyclic codes with two zeros, IEEE Trans. Inform. Theory, 57 (2011), 8000-8006. doi: 10.1109/TIT.2011.2165314. [11] C. Ding and J. Yang, Hamming weights in irreducible cyclic codes, IEEE Trans. Inform. Theory, 313 (2013), 434-446. doi: 10.1016/j.disc.2012.11.009. [12] M. van Eupen and J. H. van Lint, On the minimum distance of ternary cyclic codes, IEEE Trans. Inform. Theory, 39 (1993), 409-422. doi: 10.1109/18.212272. [13] W. C. Huffman and V. Pless, Fundamentals of Error-Correcting Codes, Cambridge Univ. Press, Cambridge, 2003. doi: 10.1017/CBO9780511807077. [14] J. H. van Lint and R. M. Wilson, On the minimum distance of cyclic codes, IEEE Trans. Inform. Theory, 32 (1986), 23-40. doi: 10.1109/TIT.1986.1057134. [15] C. Ma, L. Zeng and Y. Liu et al., The weight enumerator of a class of cyclic codes, IEEE Trans. Inform. Theory, 57 (2011), 397-402. doi: 10.1109/TIT.2010.2090272. [16] Y. Sun, T. Yan and H. Li, Cyclic code from the first class Whiteman's generalized cyclotomic sequence with order 4, preprint, arXiv:1303.6378 [17] A. L. Whiteman, A family of difference sets, Illinois J. Math., 6 (1962) 107-121. [18] T. Yan, X. Du, G. Xiao and X. Huang, Linear complexity of binary Whiteman generalized cyclotomic sequences of order $2k$, Inform. Sci., 179 (2009), 1019-1023. doi: 10.1016/j.ins.2008.11.006. [19] T. Yan, B. Huang and G. Xiao, Cryptographic properties of some binary generalized cyclotomic sequences with the length $p^2$, Inform. Sci., 178 (2008), 1078-1086. doi: 10.1016/j.ins.2007.02.040. [20] J. Yang, M. Xiong and C. Ding, Weight distribution of a class of cyclic codes with arbitrary number of zeros, IEEE Trans. Inform. Theory, 9 (2013), 5985-5993. doi: 10.1109/TIT.2013.2266731. [21] Z. Zhou and C. Ding, A class of three-weight cyclic codes, Finite Fields Appl., 25 (2014), 79-93. doi: 10.1016/j.ffa.2013.08.005. [22] Z. Zhou, C. Ding, J. Luo and A. Zhang, A family of five-weight cyclic codes and their weight enumerators, IEEE Trans. Inform. Theory, 10 (2013), 6674-6682. doi: 10.1109/TIT.2013.2267722. [23] Z. Zhou, A. Zhang and C. Ding, The weight enumerator of three families of cyclic codes, IEEE Trans. Inform. Theory, 9 (2013), 6002-6009. doi: 10.1109/TIT.2013.2262095.
 [1] San Ling, Buket Özkaya. New bounds on the minimum distance of cyclic codes. Advances in Mathematics of Communications, 2021, 15 (1) : 1-8. doi: 10.3934/amc.2020038 [2] José Joaquín Bernal, Diana H. Bueno-Carreño, Juan Jacobo Simón. Cyclic and BCH codes whose minimum distance equals their maximum BCH bound. Advances in Mathematics of Communications, 2016, 10 (2) : 459-474. doi: 10.3934/amc.2016018 [3] Jinmei Fan, Yanhai Zhang. Optimal quinary negacyclic codes with minimum distance four. Advances in Mathematics of Communications, 2021  doi: 10.3934/amc.2021043 [4] Carlos Munuera, Fernando Torres. A note on the order bound on the minimum distance of AG codes and acute semigroups. Advances in Mathematics of Communications, 2008, 2 (2) : 175-181. doi: 10.3934/amc.2008.2.175 [5] Bram van Asch, Frans Martens. A note on the minimum Lee distance of certain self-dual modular codes. Advances in Mathematics of Communications, 2012, 6 (1) : 65-68. doi: 10.3934/amc.2012.6.65 [6] Liqin Hu, Qin Yue, Fengmei Liu. Linear complexity of cyclotomic sequences of order six and BCH codes over GF(3). Advances in Mathematics of Communications, 2014, 8 (3) : 297-312. doi: 10.3934/amc.2014.8.297 [7] Lin Yi, Xiangyong Zeng, Zhimin Sun, Shasha Zhang. On the linear complexity and autocorrelation of generalized cyclotomic binary sequences with period $4p^n$. Advances in Mathematics of Communications, 2021  doi: 10.3934/amc.2021019 [8] Jérôme Ducoat, Frédérique Oggier. On skew polynomial codes and lattices from quotients of cyclic division algebras. Advances in Mathematics of Communications, 2016, 10 (1) : 79-94. doi: 10.3934/amc.2016.10.79 [9] Claude Carlet. Expressing the minimum distance, weight distribution and covering radius of codes by means of the algebraic and numerical normal forms of their indicators. Advances in Mathematics of Communications, 2022  doi: 10.3934/amc.2022047 [10] Ricardo A. Podestá, Denis E. Videla. The weight distribution of irreducible cyclic codes associated with decomposable generalized Paley graphs. Advances in Mathematics of Communications, 2021  doi: 10.3934/amc.2021002 [11] Shanding Xu, Xiwang Cao, Jiafu Mi, Chunming Tang. More cyclotomic constructions of optimal frequency-hopping sequences. Advances in Mathematics of Communications, 2019, 13 (3) : 373-391. doi: 10.3934/amc.2019024 [12] Petr Lisoněk, Layla Trummer. Algorithms for the minimum weight of linear codes. Advances in Mathematics of Communications, 2016, 10 (1) : 195-207. doi: 10.3934/amc.2016.10.195 [13] Chuang Peng. Minimum degrees of polynomial models on time series. Conference Publications, 2005, 2005 (Special) : 720-729. doi: 10.3934/proc.2005.2005.720 [14] Cem Güneri, Ferruh Özbudak, Funda ÖzdemIr. On complementary dual additive cyclic codes. Advances in Mathematics of Communications, 2017, 11 (2) : 353-357. doi: 10.3934/amc.2017028 [15] Nabil Bennenni, Kenza Guenda, Sihem Mesnager. DNA cyclic codes over rings. Advances in Mathematics of Communications, 2017, 11 (1) : 83-98. doi: 10.3934/amc.2017004 [16] Heide Gluesing-Luerssen, Katherine Morrison, Carolyn Troha. Cyclic orbit codes and stabilizer subfields. Advances in Mathematics of Communications, 2015, 9 (2) : 177-197. doi: 10.3934/amc.2015.9.177 [17] Victor J. W. Guo. A family of $q$-congruences modulo the square of a cyclotomic polynomial. Electronic Research Archive, 2020, 28 (2) : 1031-1036. doi: 10.3934/era.2020055 [18] Yujuan Li, Guizhen Zhu. On the error distance of extended Reed-Solomon codes. Advances in Mathematics of Communications, 2016, 10 (2) : 413-427. doi: 10.3934/amc.2016015 [19] John Sheekey. A new family of linear maximum rank distance codes. Advances in Mathematics of Communications, 2016, 10 (3) : 475-488. doi: 10.3934/amc.2016019 [20] Carlos Munuera, Morgan Barbier. Wet paper codes and the dual distance in steganography. Advances in Mathematics of Communications, 2012, 6 (3) : 273-285. doi: 10.3934/amc.2012.6.273

2021 Impact Factor: 1.015