pith. sign in

arxiv: 1602.04487 · v3 · pith:HEJJDJYMnew · submitted 2016-02-14 · 💻 cs.IT · math.CO· math.IT· math.NT

Aperiodic Crosscorrelation of Sequences Derived from Characters

classification 💻 cs.IT math.COmath.ITmath.NT
keywords sequencesaperiodiccrosscorrelationmeansquarecharactersm-sequencesasymptotic
0
0 comments X
read the original abstract

It is shown that 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 formulae 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 is presented that shows that sequences of modest length have performance that closely approximates the asymptotic formulae.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.