Binary m-sequences with three-valued crosscorrelation: a proof of Welch's conjecture
Authors:
- P. CharpinPCP. Charpin
- H. DobbertinHDH. Dobbertin
- 1 January 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 46 (1) , 4-8
Abstract
We prove the long-standing conjecture of Welch stating that for odd n=2m+1, the power function xd with d=2m+3 is maximally nonlinear on GF(2n) or, in other terms, that the crosscorrelation function between a binary maximum-length linear shift register sequence of degree n and a decimation of that sequence by 2m+3 takes on precisely the three values -1, -1±2m+1Keywords
This publication has 9 references indexed in Scilit:
- Weight Divisibility of Cyclic Codes, Highly Nonlinear Functions on F2m, and Crosscorrelation of Maximum-Length SequencesSIAM Journal on Discrete Mathematics, 2000
- Almost perfect nonlinear power functions on GF(2/sup n/): the Welch caseIEEE Transactions on Information Theory, 1999
- Couples de suites binaires de longueur maximale ayant une corrélation croisée à trois valeurs: conjecture de WelchComptes Rendus de l'Académie des Sciences - Series I - Mathematics, 1999
- Codes, Bent Functions and Permutations Suitable For DES-like CryptosystemsDesigns, Codes and Cryptography, 1998
- Links between differential and linear cryptanalysis1995
- Some results about the cross-correlation function between two maximal linear sequencesDiscrete Mathematics, 1976
- Weight congruences for p-ary cyclic codesDiscrete Mathematics, 1972
- Theory of transformation groups of polynomials over GF(2) with applications to linear shift register sequencesInformation Sciences, 1968
- Power moment identities on weight distributions in error correcting codesInformation and Control, 1963