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

Daniel J. Katz

arxiv: 1105.2291 · v2 · pith:HSLDCBB2new · submitted 2011-05-11 · 🧮 math.CO · cs.IT· math.IT

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

Daniel J. Katz This is my paper

classification 🧮 math.CO cs.ITmath.IT

keywords conjecturecross-correlationhellesethlinearmaximalperiodsequencesthree-valued

0 comments

read the original abstract

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.

This paper has not been read by Pith yet.

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

discussion (0)