Low Correlation Sequences From Linear Combinations of Characters

Pairs of binary sequences formed using linear combinations of multiplicative characters of finite fields are exhibited that, when compared with a random sequence pairs, simultaneously achieve significantly lower mean square autocorrelation values (for each sequence in the pair) and significantly lower mean square crosscorrelation values. If we define crosscorrelation merit factor analogously to the usual merit factor for autocorrelation, and if we define demerit factor as the reciprocal of merit factor, then randomly selected binary sequence pairs are known to have an average crosscorrelation demerit factor of 1. Our constructions provide sequence pairs with a crosscorrelation demerit factor significantly less than 1, and at the same time, the autocorrelation demerit factors of the individual sequences can also be made significantly less than 1 (which also indicates better than average performance). The sequence pairs studied here provide combinations of autocorrelation and crosscorrelation performance that are not achievable using sequences formed from single characters, such as maximal linear recursive sequences (m-sequences) and Legendre sequences. In this paper, exact asymptotic formulae are proved for the autocorrelation and crosscorrelation merit factors of sequence pairs formed using linear combinations of multiplicative characters. Data is presented that shows that the asymptotic behavior is closely approximated by sequences of modest length.

[1]  Bruce C. Berndt,et al.  The determination of Gauss sums , 1981 .

[2]  Binary sequences with good correlation properties , 1975 .

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

[4]  Ann M. Boehmer,et al.  Binary pulse compression codes , 1967, IEEE Trans. Inf. Theory.

[5]  Dilip V. Sarwate.  An upper bound on the aperiodic autocorrelation function for a maximal-length sequence , 1984, IEEE Trans. Inf. Theory.

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

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

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

[9]  Daniel J. Katz.  Aperiodic Crosscorrelation of Sequences Derived From Characters , 2016, IEEE Transactions on Information Theory.

[10]  Cunsheng Ding,et al.  Duadic sequences of prime lengths , 2000, Discret. Math..

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

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

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

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

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

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

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

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

[19]  Kwok-Kwong Stephen Choi,et al.  Explicit merit factor formulae for Fekete and Turyn polynomials , 2001 .

[20]  Christian Günther,et al.  Merit factors of polynomials derived from difference sets , 2015, J. Comb. Theory, Ser. A.

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

[22]  Jonathan Jedwab,et al.  Appended m-Sequences with Merit Factor Greater than 3.34 , 2010, SETA.

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

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

[25]  S. J. Patterson,et al.  The distribution of Kummer sums at prime arguments. , 1979 .

[26]  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.

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