Aperiodic Crosscorrelation of Sequences Derived From Characters

It is shown that the pairs of maximal linear recursive sequences (m-sequences) typically have mean square aperiodic crosscorrelation on par with that of random sequences, but that if one takes a pair of m-sequences where one is the reverse of the other, and shifts them appropriately, one can get significantly lower mean square aperiodic crosscorrelation. Sequence pairs with even lower mean square aperiodic crosscorrelation are constructed by taking a Legendre sequence, cyclically shifting it, and then cutting it (approximately) in half and using the halves as the sequences of the pair. In some of these constructions, the mean square aperiodic crosscorrelation can be lowered further if one truncates or periodically extends (appends) the sequences. Exact asymptotic formulas for mean squared aperiodic crosscorrelation are proved for sequences derived from additive characters (including m-sequences and modified versions thereof) and multiplicative characters (including Legendre sequences and their relatives). Data are presented that show that the sequences of modest length have performance that closely approximates the asymptotic formulas.

[1]  Ganesh Narayanaswamy,et al.  Construction of New Asymptotic Classes of Binary Sequences Based on Existing Asymptotic Classes , 1999 .

[2]  J. E. Littlewood,et al.  On Polynomials ∑ ±nzm,∑ eαminzm,z=e0i , 1966 .

[3]  M.B. Pursley,et al.  Crosscorrelation properties of pseudorandom and related sequences , 1980, Proceedings of the IEEE.

[4]  Dilip V. Sarwate,et al.  Bounds on aperiodic cross-correlation for binary sequences , 1976 .

[5]  Daniel J. Katz,et al.  Asymptotic $L^4$ norm of polynomials derived from characters , 2012, ArXiv.

[6]  K.H.A. Karkkainen.  Mean-Square Cross-Correlation as a Performance Measure for Department of Spreading Code Families , 1992, IEEE Second International Symposium on Spread Spectrum Techniques and Applications.

[7]  Tom Høholdt,et al.  Determination of the merit factor of Legendre sequences , 1988, IEEE Trans. Inf. Theory.

[8]  Tom Høholdt,et al.  Binary Sequences with Good Correlation Properties , 1987, AAECC.

[9]  Marcel J. E. Golay.  The merit factor of Legendre sequences , 1983, IEEE Trans. Inf. Theory.

[10]  Kwok-Kwong Stephen Choi,et al.  Merit Factors of Character Polynomials , 2000 .

[11]  Birgit Dietrich.  Number Theory In Science And Communication , 2016 .

[12]  Hu Chuan-Gan,et al.  On The Shift Register Sequences , 2004 .

[13]  Guang Gong,et al.  Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar , 2005 .

[14]  Jonathan Jedwab,et al.  Littlewood Polynomials with Small $L^4$ Norm , 2012, ArXiv.

[15]  Jonathan Jedwab,et al.  Advances in the merit factor problem for binary sequences , 2012, J. Comb. Theory, Ser. A.

[16]  Robert A. Scholtz,et al.  Group characters: Sequences with good correlation properties , 1978, IEEE Trans. Inf. Theory.

[17]  A. Weil.  On Some Exponential Sums. , 1948, Proceedings of the National Academy of Sciences of the United States of America.

[18]  H. Niederreiter,et al.  Finite Fields: Encyclopedia of Mathematics and Its Applications. , 1997 .

[19]  J. Littlewood.  Some problems in real and complex analysis , 1968 .

[20]  Marcel J. E. Golay.  A class of finite binary sequences with alternate auto-correlation values equal to zero (Corresp.) , 1972, IEEE Trans. Inf. Theory.

[21]  Tom Høholdt,et al.  The merit factor of binary sequences related to difference sets , 1991, IEEE Trans. Inf. Theory.

[22]  D. V. Sarwate,et al.  Mean-square correlation of shift-register sequences , 1984 .

[23]  Peter B. Borwein,et al.  Binary sequences with merit factor greater than 6.34 , 2004, IEEE Transactions on Information Theory.