Duadic sequences of prime lengths Original Research Article

Legendre sequences have a number of interesting properties. Their counterparts in coding theory are binary quadratic residue codes. In this paper we study a class of binary sequences, called duadic sequences whose counterparts in coding theory are duadic codes. We calculate their linear complexity, study their autocorrelation and crosscorrelation properties, give exact formulas for the number of bigrams in a cycle, investigate their decimation properties, and discuss their implementation.