I think that this is equivalent to a known open question. Here are
the details. For K:=mathbbF2n, the function f:ymapstoy+y2:KtoK is mathbbF2-linear, and its kernel 0,1 has
dimension 1. The image is therefore of dimension n−1, and for z in
the image, the fiber f−1(z) has exactly 2 elements.
Hence, to prove that y2+y=xk+ax has exactly 2n solutions
for some fixed ainK, we have to show that |xinK|xk+axinmathrmIm(f)|=2n−1.
Since sigma:ymapstoy2 is a generator of the Galois group of
K/mathbbF2, Hilbert's Theorem 90 (in additive form) says that
zinmathrmIm(f) if and only if mathrmTr(z)=0, where
mathrmTr stands for the trace map from K to mathbbF2.
So the problem is equivalent to showing that there exists an aneq0 in K
such that |xinK|mathrmTr(xk+ax)=0|=2n−1. In other
words, we would like to show that there exists a nonzero ainK such that
Sk(a):=sumxinK(−1)mathrmTr(xk+ax)=0.
Apparently, this question was addressed in the coding community. In
detail, in [1, p. 258], the following conjecture (of Helleseth) is
mentioned:
``Conjecture 3. For any m and k such that
mathrmgcd(2m−1,k)=1, the sum
sumxinmathbbF2m(−1)mathrmTr(xk+ax) is null for at
least one nonzero a.'' (Note that n in the current question is
m in 1).
It seems that in [1, Corollary 1, p. 253], Conjecture 3 is proved for
even m and for certain values of k (the ``Niho exponents,''
defined on p. 252 of 1).
Interestingly, at least at a first glance it seems that 1 has
nothing to say on kin1,ldots,2n−1, but to me it seems that
this case is trivial (am I missing something?): Consider a normal
basis for K/mathbbF2, that is, a basis B consisting of an orbit of
an element gammainK under the Galois group of K/mathbbF2
(the ith element of B is bi:=gamma2i for
iin0,ldots,n−1).
From the linearity of the trace and the fact that the trace is onto,
we must have mathrmTr(b)=1 for at least one element binB, and
from mathrmTr(b2)=mathrmTr(b) we then have
mathrmTr(b)=1 for all binB. So the trace of an element in K
is just the modulo-2 sum of the coefficients in its decomposition
according to the basis B.
Let a be any element in the
trace-dual basis of B, say mathrmTr(abi)=deltai,0. Then
for k=2j, if we write x=sumialphaibi, we
get: mathrmTr(ax)=alpha0,
mathrmTr(xk)=mathrmTr(x)=sumalphai (sum in
mathbbF2). These agree for half of the xinK, as required.
That's about it. I hope at least some of this makes sense :) I also
hope that the original person asking this question didn't actually want
to solve the above open question by converting it to a question about
curves, for then this answer is useless.
1 P. Charpin, ``Cyclic codes with few weights and Niho exponents,''
Journal of Combinatorial Theory, Series A 108 (2004)
247--259.
No comments:
Post a Comment