2 research outputs found
Linear complexity of quaternary sequences over Z4 based on Ding-Helleseth generalized cyclotomic classes
A family of quaternary sequences over Z4 is defined based on the
Ding-Helleseth generalized cyclotomic classes modulo pq for two distinct odd
primes p and q. The linear complexity is determined by computing the defining
polynomial of the sequences, which is in fact connected with the discrete
Fourier transform of the sequences. The results show that the sequences possess
large linear complexity and are good sequences from the viewpoint of
cryptography
Linear complexity and trace representation of quaternary sequences over based on generalized cyclotomic classes modulo
We define a family of quaternary sequences over the residue class ring modulo
of length , a product of two distinct odd primes, using the generalized
cyclotomic classes modulo and calculate the discrete Fourier transform
(DFT) of the sequences. The DFT helps us to determine the exact values of
linear complexity and the trace representation of the sequences.Comment: 16 page