New Sarwate Bounds on Aperiodic Correlation of Sequences over pth Roots of Unity

The minimum aperiodic crosscorrelation of binary sequences of size M and length n over the alphabet E={1, -1} has been obtained by Levenshtein for M≥4 and n≥2 These bounds improve a long standing bound given by Welch. In this paper, the Sarwate bounds for codes over the p th roots of unity with the same parameters M and n are discussed, that is,the lower bounds and trade off are established for the maximum magnitude of the aperiodic crosscorrelation function and the maximum magnitude of the out of phase aperiodic autocorrelation function for the sets of periodic sequences with the same parameters M and n by using the modified Levenshtein method. The results show that new bounds are tighter than Sarwate bounds and Levenshtein bounds.