The Walsh transform of a class of monomial functions and cyclic codes

AbstractLet 𝔽p be a finite field with p elements, where p is a prime. Let N ≥ 2 be an integer and f the least positive integer satisfying pf ≡ −1 (mod N). Then we let q = p2f and r = qm. In this paper, we study the Walsh transform of the monomial function f(x)=Trr/p(axr−1N)$f(x)=\text {Tr}_{r/p}(ax^{\frac {r-1} N})$ for a∈𝔽r∗$a \in \Bbb F_{r}^{*}$. We shall present the value distribution of the Walsh transform of f(x) and show that it takes at most min{p,N}+1$\min \{p, N\}+1$ distinct values. In particular, we can obtain binary functions with three-valued Walsh transform and ternary functions with three-valued or four-valued Walsh transform. Furthermore, we present two classes of four-weight binary cyclic codes and six-weight ternary cyclic codes.