On the minimum distance of cyclic codes
IEEE Transactions on Information Theory
Almost perfect nonlinear power functions on GF (2n): the Niho case
Information and Computation
SIAM Journal on Discrete Mathematics
Some new three-valued crosscorrelation functions for binary m-sequences
IEEE Transactions on Information Theory
Almost perfect nonlinear power functions on GF(2n): the Welch case
IEEE Transactions on Information Theory
Binary m-sequences with three-valued crosscorrelation: a proof of Welch's conjecture
IEEE Transactions on Information Theory
Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
IEEE Transactions on Information Theory
A Proof of the Welch and Niho Conjectures on Cross-Correlations of Binary m-Sequences
Finite Fields and Their Applications
Cyclic codes with few weights and Niho exponents
Journal of Combinatorial Theory Series A
On Niho type cross-correlation functions of m-sequences
Finite Fields and Their Applications
Hi-index | 0.00 |
We show that the dual code of the binary cyclic code of length 2^m-1 with two zeros @a,@a^d cannot have three weights in the case that m is even and d=0(mod3). The proof involves the partial calculation of a coset weight distribution.