Buradasınız

On the Linear Complexity of Ding-Helleseth Generalized Cyclotomic Binary Sequences of Order Four and Six

Journal Name:

Publication Year:

Abstract (2. Language): 
We propose a new computation method for the linear complexity and the minimal polynomial of Ding-Helleseth-generalized cyclotomic sequences. We will find the linear complexity of Ding-Helleseth-generalized cyclotomic sequences of order four and six and make the results of Tong'iang Yan et. al [19] about the sequences of order four more specific.
256
266

REFERENCES

References: 

[ 1 ] E. Bai, X. Liu, and G. Xiao. Linear complexity of new generalized cyclotomic sequences of order two of length pq. IEEE Transactions on Information Theory, 51:1849-1853, 2005.
[2] Z. Chen and S. Li. Some Notes on Generalized Cyclotomic Sequences of Length pq. Journal of Computer Science and Technology, 23(5):843-850, 2008.
[3] T. W. Cusick, C. Ding, and A. Renvall. Stream Ciphers and Number Theory. North-Holland Mathematical Library, North-Holland Publishing Co., Amsterdam, 1998.
[4] C. Ding. Linear complexity of generalized cyclotomic binary sequences of order 2. Finite Fields and Their Applications, 3(2):159-174, 1997.
[ 5 ] C. Ding. Autocorrelation values of generalized cyclotomic sequences of order two. IEEE Transactions on Information Theory, 44(5):1699-1702, 1998.
REFERENCES
265
[6] C. Ding. New generalized cyclotomy and its applications. Finite Fields and Their Applications, 4(2):140-166, 1998.
[7] C. Ding and T. Helleseth. Generalized cyclotomic codes of length ... . IEEE Transactions on Information Theory, 45(2):467-474, 1999.
[8] C. Ding, T. Helleseth, and W. Shan. On the linear complexity of Legendre sequences. IEEE Transactions on Information Theory, 44:1276-1278, 1998.
[9] V.A. Edemskii. On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes. Discrete Mathematics and Applications, 20(1):75-84, 2010.
[10] V.A. Edemskiy. Linear complexity of ternary sequences formed on the basis of power residue classes. Problems ofInformation Transmission., 44(4):287-294, 2008.
[11] M. Hall. A survey of difference sets. Proceedings of the American Mathematical Society, 7:975-986, 1056.
[12] K. Ireland and M. Rosen. A Classical introduction to modern number theory. Springer-Verlag, North-Holland Publishing Co., Amsterdam, 1982.
[13] J.H. Kim and H.Y. Song. On the linear complexity of halls sextic residue sequences. IEEE Transactions on Information Theory, 47(5):2094-2096, 2001.
[14] R. Lidl and H. Niederreiter. Finite Fields. Addison-Wesley Press, Massachusetts, 1983.
[15] W. Meidl. Remarks on a cyclotomic sequence. Designs, Codes, and Cryptography, 51(1):33-44, 2009.
[16] W. Meidl and A. Winterhof. On the autocorrelation of cyclotomic generators. In Lecture Notes in Computer Science., volume 2948. Springer, Berlin, 2004.
[17] A.L. Whiteman. A family of difference sets. Illinois Journal of Mathematics, 6:107-121,
1962.
[18] T Yan. Linear complexity of ding-helleseth generalized cyclotomic binary sequences of any order. eprint arXiv 1108.4450, 2011.
[19] T. Yan, L. Hong, and G. Xiao. The linear complexity of new generalized cyclotomic binary sequences of order four. Information Sciences, 178(3):2094-2096, 2008.

Thank you for copying data from http://www.arastirmax.com