Introduction to finite fields and their applications
Introduction to finite fields and their applications
On cyclotomic generator of order r
Information Processing Letters
Remarks on a cyclotomic sequence
Designs, Codes and Cryptography
Linear complexity of generalized cyclotomic binary sequences of length 2p m
Applicable Algebra in Engineering, Communication and Computing
On the linear complexity of Legendre sequences
IEEE Transactions on Information Theory
Autocorrelation values of generalized cyclotomic sequences of order two
IEEE Transactions on Information Theory
On the linear complexity of Hall's sextic residue sequences
IEEE Transactions on Information Theory
Linear complexity of new generalized cyclotomic sequences of order two of length pq
IEEE Transactions on Information Theory
Some notes on the two-prime generator of order 2
IEEE Transactions on Information Theory
Linear Complexity of Generalized Cyclotomic Binary Sequences of Order 2
Finite Fields and Their Applications
| Hi-index | 0.00 |
We give a general approach to N-periodic sequences over a finite field Fq 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.