Linear complexity and autocorrelation values of a polyphase generalized cyclotomic sequence of length pq

Abstract

A construction of a family of generalized polyphase cyclotomic sequences of length pq is presented in terms of the generalized cyclotomic classes modulo pq. Their linear complexity and corresponding minimal polynomials are deduced. Some upper bounds on periodic and aperiodic autocorrelation values of resulting sequences are also estimated by using certain exponential sums.

Keywords

stream cipher / cyclotomic sequence / linear complexity / autocorrelation value / generalized cyclotomic classes