# American Institute of Mathematical Sciences

August  2014, 8(3): 297-312. doi: 10.3934/amc.2014.8.297

## Linear complexity of cyclotomic sequences of order six and BCH codes over GF(3)

 1 Department of Mathematics, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China, China 2 Science and Technology on Information Assurance Laboratory, Beijing, 100072, China

Received  April 2013 Revised  December 2013 Published  August 2014

In this paper, we always assume that $p=6f+1$ is a prime. First, we calculate the values of exponential sums of cyclotomic classes of orders 3 and 6 over an extension field of GF(3). Then, we give a formula to compute the linear complexity of all $p^{n+1}$-periodic generalized cyclotomic sequences of order 6 over GF(3). After that, we compute the linear complexity and the minimal polynomial of a $p^{n+1}$-periodic, balanced and generalized cyclotomic sequence of order 6 over GF(3), which is analogous to a generalized Sidelnikov's sequence. At last, we give some BCH codes with prime length $p$ from cyclotomic sequences of orders three and six.
Citation: 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
##### References:
 [1] E. Bai, X. Liu and G. Xiao, Linear complexity of new generalized cyclotomic sequences of order two of length pq,, IEEE Trans. Inform. Theory, 51 (2005), 1849.  doi: 10.1109/TIT.2005.846450.  Google Scholar [2] B. C. Berndt, R. J. Evans and K. S. Williams, Gauss and Jacobi Sums,, J. Wiley and Sons Company, (1997).   Google Scholar [3] C. Ding, Linear complexity of generalized cyclotomic binary sequences of order $2$,, Finite Fields Appl., 3 (1997), 159.  doi: 10.1006/ffta.1997.0181.  Google Scholar [4] C. Ding, Autocorrelation values of generalized cyclotomic sequences of order two,, IEEE Trans. Inform. Theory, 44 (1998), 1698.  doi: 10.1109/18.681354.  Google Scholar [5] C. Ding, Pattern distribution of Legendre sequences,, IEEE Trans. Inform. Theory, 44 (1998), 1693.  doi: 10.1109/18.681353.  Google Scholar [6] C. Ding, The weight distribution of some irreducible cyclic codes,, IEEE Trans. Inform. Theory, 55 (2009), 955.  doi: 10.1109/TIT.2008.2011511.  Google Scholar [7] C. Ding, Cyclic codes from cyclotomic sequences of order four,, Finite Fields Appl., 23 (2013), 8.  doi: 10.1016/j.ffa.2013.03.006.  Google Scholar [8] C. Ding and T. Helleseth, New generalized cyclotomy and its applications,, Finite Fields Appl., 4 (1998), 140.  doi: 10.1006/ffta.1998.0207.  Google Scholar [9] C. Ding, T. Helleseth and K. Y. Lam, Several classes of sequences with three-level autocorrelation,, IEEE Trans. Inform. Theory, 45 (1999), 2606.  doi: 10.1109/18.796414.  Google Scholar [10] C. Ding, T. Helleseth and H. M. Martinsen, New families of binary sequences with optimal three-level autocorrelation,, IEEE Trans. Inform. Theory, 47 (2001), 428.  doi: 10.1109/18.904555.  Google Scholar [11] L. E. Dickson, Cyclotomy, higher congruences and Waring's problem,, Amer. J. math., 57 (1935), 391.  doi: 10.2307/2371217.  Google Scholar [12] V. A. Edemskii, On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes,, Discrete Math. Appl., 20 (2010), 75.  doi: 10.1515/DMA.2010.004.  Google Scholar [13] V. A. Edemskii, About computation of the linear complexity of generalized cyclotomic sequences with period $p^{n+1}$,, Des. Codes Cryptogr., 61 (2011), 251.  doi: 10.1007/s10623-010-9474-9.  Google Scholar [14] K. Feng and F. Liu, Algebra and Communication,, Higher education press, (2005).   Google Scholar [15] M. Hall, Combinatorial Theory,, Blaisdell Company, (1967).   Google Scholar [16] K. Ireland and M. Rosen, A classical introduction to modern number theory, Second edition,, Springer-Verlag, (2003).  doi: 10.1007/978-1-4757-2103-4.  Google Scholar [17] J. H. Kim and H. Y. Song, On the linear complexity of Hall's sextic residue sequences,, IEEE Trans. Inform. Theory, 47 (2001), 2094.  doi: 10.1109/18.930950.  Google Scholar [18] A. Lempel, M. Cohn and W. L. Estman, A class of binary sequences with optimal autocorrelation properties,, IEEE Trans. Inform. Theory, 23 (1997), 38.  doi: 10.1109/TIT.1977.1055672.  Google Scholar [19] R. Lidl and H. Niederreiter, Finite Fields,, Addison-Wesley Publishing Company, (1983).   Google Scholar [20] F. Liu, D. Y. Peng, X. H. Tang and X. H. Niu, On the autocorrelation and the linear complexity of $q$-ary prime $n$-square sequences,, in Sequences and their Applications- SETA 2010, (2010), 139.  doi: 10.1007/978-3-642-15874-2_11.  Google Scholar [21] V. M. Sidelnikov, Some k-valued pseudo-random sequences and nearly equidistance codes,, Probl. Inform. Transm., 5 (1969), 12.   Google Scholar [22] A. L. Whiteman, The cyclotomic numbers of order twelve,, Acta Arith., 6 (1960), 53.   Google Scholar

show all references

##### References:
 [1] E. Bai, X. Liu and G. Xiao, Linear complexity of new generalized cyclotomic sequences of order two of length pq,, IEEE Trans. Inform. Theory, 51 (2005), 1849.  doi: 10.1109/TIT.2005.846450.  Google Scholar [2] B. C. Berndt, R. J. Evans and K. S. Williams, Gauss and Jacobi Sums,, J. Wiley and Sons Company, (1997).   Google Scholar [3] C. Ding, Linear complexity of generalized cyclotomic binary sequences of order $2$,, Finite Fields Appl., 3 (1997), 159.  doi: 10.1006/ffta.1997.0181.  Google Scholar [4] C. Ding, Autocorrelation values of generalized cyclotomic sequences of order two,, IEEE Trans. Inform. Theory, 44 (1998), 1698.  doi: 10.1109/18.681354.  Google Scholar [5] C. Ding, Pattern distribution of Legendre sequences,, IEEE Trans. Inform. Theory, 44 (1998), 1693.  doi: 10.1109/18.681353.  Google Scholar [6] C. Ding, The weight distribution of some irreducible cyclic codes,, IEEE Trans. Inform. Theory, 55 (2009), 955.  doi: 10.1109/TIT.2008.2011511.  Google Scholar [7] C. Ding, Cyclic codes from cyclotomic sequences of order four,, Finite Fields Appl., 23 (2013), 8.  doi: 10.1016/j.ffa.2013.03.006.  Google Scholar [8] C. Ding and T. Helleseth, New generalized cyclotomy and its applications,, Finite Fields Appl., 4 (1998), 140.  doi: 10.1006/ffta.1998.0207.  Google Scholar [9] C. Ding, T. Helleseth and K. Y. Lam, Several classes of sequences with three-level autocorrelation,, IEEE Trans. Inform. Theory, 45 (1999), 2606.  doi: 10.1109/18.796414.  Google Scholar [10] C. Ding, T. Helleseth and H. M. Martinsen, New families of binary sequences with optimal three-level autocorrelation,, IEEE Trans. Inform. Theory, 47 (2001), 428.  doi: 10.1109/18.904555.  Google Scholar [11] L. E. Dickson, Cyclotomy, higher congruences and Waring's problem,, Amer. J. math., 57 (1935), 391.  doi: 10.2307/2371217.  Google Scholar [12] V. A. Edemskii, On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes,, Discrete Math. Appl., 20 (2010), 75.  doi: 10.1515/DMA.2010.004.  Google Scholar [13] V. A. Edemskii, About computation of the linear complexity of generalized cyclotomic sequences with period $p^{n+1}$,, Des. Codes Cryptogr., 61 (2011), 251.  doi: 10.1007/s10623-010-9474-9.  Google Scholar [14] K. Feng and F. Liu, Algebra and Communication,, Higher education press, (2005).   Google Scholar [15] M. Hall, Combinatorial Theory,, Blaisdell Company, (1967).   Google Scholar [16] K. Ireland and M. Rosen, A classical introduction to modern number theory, Second edition,, Springer-Verlag, (2003).  doi: 10.1007/978-1-4757-2103-4.  Google Scholar [17] J. H. Kim and H. Y. Song, On the linear complexity of Hall's sextic residue sequences,, IEEE Trans. Inform. Theory, 47 (2001), 2094.  doi: 10.1109/18.930950.  Google Scholar [18] A. Lempel, M. Cohn and W. L. Estman, A class of binary sequences with optimal autocorrelation properties,, IEEE Trans. Inform. Theory, 23 (1997), 38.  doi: 10.1109/TIT.1977.1055672.  Google Scholar [19] R. Lidl and H. Niederreiter, Finite Fields,, Addison-Wesley Publishing Company, (1983).   Google Scholar [20] F. Liu, D. Y. Peng, X. H. Tang and X. H. Niu, On the autocorrelation and the linear complexity of $q$-ary prime $n$-square sequences,, in Sequences and their Applications- SETA 2010, (2010), 139.  doi: 10.1007/978-3-642-15874-2_11.  Google Scholar [21] V. M. Sidelnikov, Some k-valued pseudo-random sequences and nearly equidistance codes,, Probl. Inform. Transm., 5 (1969), 12.   Google Scholar [22] A. L. Whiteman, The cyclotomic numbers of order twelve,, Acta Arith., 6 (1960), 53.   Google Scholar
 [1] Thierry Horsin, Mohamed Ali Jendoubi. On the convergence to equilibria of a sequence defined by an implicit scheme. Discrete & Continuous Dynamical Systems - S, 2020  doi: 10.3934/dcdss.2020465 [2] Mark F. Demers. Uniqueness and exponential mixing for the measure of maximal entropy for piecewise hyperbolic maps. Discrete & Continuous Dynamical Systems - A, 2021, 41 (1) : 217-256. doi: 10.3934/dcds.2020217 [3] João Marcos do Ó, Bruno Ribeiro, Bernhard Ruf. Hamiltonian elliptic systems in dimension two with arbitrary and double exponential growth conditions. Discrete & Continuous Dynamical Systems - A, 2021, 41 (1) : 277-296. doi: 10.3934/dcds.2020138 [4] Yuanfen Xiao. Mean Li-Yorke chaotic set along polynomial sequence with full Hausdorff dimension for $\beta$-transformation. Discrete & Continuous Dynamical Systems - A, 2021, 41 (2) : 525-536. doi: 10.3934/dcds.2020267 [5] Gervy Marie Angeles, Gilbert Peralta. Energy method for exponential stability of coupled one-dimensional hyperbolic PDE-ODE systems. Evolution Equations & Control Theory, 2020  doi: 10.3934/eect.2020108 [6] Shengbing Deng, Tingxi Hu, Chun-Lei Tang. $N-$Laplacian problems with critical double exponential nonlinearities. Discrete & Continuous Dynamical Systems - A, 2021, 41 (2) : 987-1003. doi: 10.3934/dcds.2020306 [7] Manil T. Mohan. Global attractors, exponential attractors and determining modes for the three dimensional Kelvin-Voigt fluids with "fading memory". Evolution Equations & Control Theory, 2020  doi: 10.3934/eect.2020105

2019 Impact Factor: 0.734