120 research outputs found

    Proofs of two conjectures on ternary weakly regular bent functions

    Full text link
    We study ternary monomial functions of the form f(x)=\Tr_n(ax^d), where x\in \Ff_{3^n} and \Tr_n: \Ff_{3^n}\to \Ff_3 is the absolute trace function. Using a lemma of Hou \cite{hou}, Stickelberger's theorem on Gauss sums, and certain ternary weight inequalities, we show that certain ternary monomial functions arising from \cite{hk1} are weakly regular bent, settling a conjecture of Helleseth and Kholosha \cite{hk1}. We also prove that the Coulter-Matthews bent functions are weakly regular.Comment: 20 page

    On the normality of pp-ary bent functions

    Full text link
    Depending on the parity of nn and the regularity of a bent function ff from Fpn\mathbb F_p^n to Fp\mathbb F_p, ff can be affine on a subspace of dimension at most n/2n/2, (n1)/2(n-1)/2 or n/21n/2- 1. We point out that many pp-ary bent functions take on this bound, and it seems not easy to find examples for which one can show a different behaviour. This resembles the situation for Boolean bent functions of which many are (weakly) n/2n/2-normal, i.e. affine on a n/2n/2-dimensional subspace. However applying an algorithm by Canteaut et.al., some Boolean bent functions were shown to be not n/2n/2- normal. We develop an algorithm for testing normality for functions from Fpn\mathbb F_p^n to Fp\mathbb F_p. Applying the algorithm, for some bent functions in small dimension we show that they do not take on the bound on normality. Applying direct sum of functions this yields bent functions with this property in infinitely many dimensions.Comment: 13 page

    (2^n,2^n,2^n,1)-relative difference sets and their representations

    Full text link
    We show that every (2n,2n,2n,1)(2^n,2^n,2^n,1)-relative difference set DD in Z4n\Z_4^n relative to Z2n\Z_2^n can be represented by a polynomial f(x)\in \F_{2^n}[x], where f(x+a)+f(x)+xaf(x+a)+f(x)+xa is a permutation for each nonzero aa. We call such an ff a planar function on \F_{2^n}. The projective plane Π\Pi obtained from DD in the way of Ganley and Spence \cite{ganley_relative_1975} is coordinatized, and we obtain necessary and sufficient conditions of Π\Pi to be a presemifield plane. We also prove that a function ff on \F_{2^n} with exactly two elements in its image set and f(0)=0f(0)=0 is planar, if and only if, f(x+y)=f(x)+f(y)f(x+y)=f(x)+f(y) for any x,y\in\F_{2^n}

    P\wpN functions, complete mappings and quasigroup difference sets

    Full text link
    We investigate pairs of permutations F,GF,G of Fpn\mathbb{F}_{p^n} such that F(x+a)G(x)F(x+a)-G(x) is a permutation for every aFpna\in\mathbb{F}_{p^n}. We show that necessarily G(x)=(F(x))G(x) = \wp(F(x)) for some complete mapping -\wp of Fpn\mathbb{F}_{p^n}, and call the permutation FF a perfect \wp nonlinear (P\wpN) function. If (x)=cx\wp(x) = cx, then FF is a PcN function, which have been considered in the literature, lately. With a binary operation on Fpn×Fpn\mathbb{F}_{p^n}\times\mathbb{F}_{p^n} involving \wp, we obtain a quasigroup, and show that the graph of a P\wpN function FF is a difference set in the respective quasigroup. We further point to variants of symmetric designs obtained from such quasigroup difference sets. Finally, we analyze an equivalence (naturally defined via the automorphism group of the respective quasigroup) for P\wpN functions, respectively, the difference sets in the corresponding quasigroup
    corecore