A General Approach to Construction and Determination of the Linear Complexity of Sequences Based on Cosets
- Cite this paper as:
- Ç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
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.
Unable to display preview. Download preview PDF.