Proof of a Conjecture of Helleseth: Maximal Linear Recursive Sequences of Period $2^{2^n}-1$ Never Have Three-Valued Cross-Correlation

Details Proof of a Conjecture of Helleseth: Maximal Linear Recursive Sequences of Period $2^{2^n}-1$ Never Have Three-Valued Cross-Correlation Proof of a Conjecture of Helleseth: Maximal Linear Recursive Sequences of Period $2^{2^n}-1$ Never Have Three-Valued Cross-Correlation

2011-05-11

arxiv.org/abs/1105.2291v2

Mathematics

Combinatorics

5 pages, fixes typos in first version

Scientific paper

We prove a conjecture of Helleseth that claims that for any $n \geq 0$, a
pair of binary maximal linear sequences of period $2^{2^n}-1$ can not have a
three-valued cross-correlation function.

Affiliated with

Also associated with

No associations

Rating

Proof of a Conjecture of Helleseth: Maximal Linear Recursive Sequences of Period $2^{2^n}-1$ Never Have Three-Valued Cross-Correlation 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 Proof of a Conjecture of Helleseth: Maximal Linear Recursive Sequences of Period $2^{2^n}-1$ Never Have Three-Valued Cross-Correlation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Proof of a Conjecture of Helleseth: Maximal Linear Recursive Sequences of Period $2^{2^n}-1$ Never Have Three-Valued Cross-Correlation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-612292