Abstract
We give a general approach to N-periodic sequences over a finite field \(\mathbb F_q\) constructed via a subgroup D of the group of invertible elements modulo N. Well known examples are Legendre sequences or the two-prime generator. For some generalizations of sequences considered in the literature and for some new examples of sequence constructions we determine the linear complexity.
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
Bai, E., Liu, X., Xiao, G.: Linear complexity of new generalized cyclotomic sequences of order two of length pq. IEEE Trans. Inform. Theory 51, 1849–1853 (2005)
Brandstätter, N., Winterhof, A.: Some notes on the two-prime generator of order 2. IEEE Trans. Inform. Theory 51, 3654–3657 (2005)
Cusick, T.W., Ding, C., Renvall, A.: Stream Ciphers and Number Theory. North-Holland Publishing Co., Amsterdam (1998)
Dai, Z., Yang, J., Gong, G., Wang, P.: On the linear complexity of generalized Legendre sequences. In: Sequences and their Applications, 145–153 (2001); Discrete Math. Theor. Comput. Sci. (Lond.). Springer, London (2002)
Ding, C., Helleseth, T., Shan, W.: On the linear complexity of Legendre sequences. IEEE Trans. Inform. Theory 44, 1276–1278 (1998)
Ding, C., Helleseth, T.: On cyclotomic generator of order r. Inform. Process. Letters 66, 21–25 (1998)
Ding, C.: Linear complexity of generalized cyclotomic binary sequences of order 2. Finite Fields Appl. 3, 159–174 (1997)
Ding, C.: Autocorrelation values of generalized cyclotomic sequences of order two. IEEE Trans. Inform. Theory 44, 1699–1702 (1998)
Green, D., Garcia-Perera, L.: The linear complexity of related prime sequences. Proc. R. Soc. Lond. A 460, 487–498 (2004)
Kim, J.-H., Song, H.-Y.: On the linear complexity of Hall’s sextic residue sequences. IEEE Trans. Inform. Theory 47, 2094–2096 (2001)
Lidl, R., Niederreiter, H.: Introduction to Finite Fields and their Applications. Cambridge University Press, Cambridge (1986)
Meidl, W.: Remarks on a cyclotomic sequence. Designs, Codes and Cryptography 51, 33–43 (2009)
Niederreiter, H.: Linear complexity and related complexity measures for sequences. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 1–17. Springer, Heidelberg (2003)
Yan, T., Li, S., Xiao, G.: On the linear complexity of generalized cyclotomic sequences with the period p m. Appl. Math. Lett. 21, 187–193 (2008)
Yan, T., Chen, Z., Xiao, G.: Linear complexity of Ding generalized cyclotomic sequences. Journal of Shanghai University (English Edition) 11, 22–26 (2007)
Zhang, J., Zhao, C.A., Ma, X.: Linear complexity of generalized cyclotomic sequences with length 2p m. AAECC 21, 93–108 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Çeşmelioğlu, A., Meidl, W. (2010). A General Approach to Construction and Determination of the Linear Complexity of Sequences Based on Cosets. In: Carlet, C., Pott, A. (eds) Sequences and Their Applications – SETA 2010. SETA 2010. Lecture Notes in Computer Science, vol 6338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15874-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-15874-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15873-5
Online ISBN: 978-3-642-15874-2
eBook Packages: Computer ScienceComputer Science (R0)