7 research outputs found
A general approach to construction and determination of the linear complexity of sequences based on cosets
We give a general approach to -periodic sequences over a finite field \F_q constructed via a subgroup of the group of invertible elements modulo . 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
Autocorrelation of a class of quaternary sequences of period
Sequences with good randomness properties are quite important for stream
ciphers. In this paper, a new class of quaternary sequences is constructed by
using generalized cyclotomic classes of . The
exact values of autocorrelation of these sequences are determined based on
cyclotomic numbers of order with respect to . Results show that the
presented sequences have the autocorrelations with at most values