Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences

Details Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences

2008-12-17

arxiv.org/abs/0812.3186v3

Mathematics

Combinatorics

Improved Introduction and new Section 6 (Lovasz local lemma)

Scientific paper

Motivated by the known autocorrelation properties of the Rudin-Shapiro sequence, we study the discrete correlation among infinite sequences over a finite alphabet, where we just take into account whether two symbols are identical. We show by combinatorial means that sequences cannot be "too" different, and by an explicit construction generalizing the Rudin-Shapiro sequence, we show that we can achieve the maximum possible difference.

Affiliated with

Also associated with

No associations

Rating

Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-94370