English
Related papers

Related papers: New Binomial Bent Function over the Finite Fields …

200 papers

We consider the vector space $E_{\rho,p}$ of entire functions of finite order, whose types are not more than $p>0$, endowed with Frechet topology, which is generated by a sequence of weighted norms. We call a function $f\in E_{\rho,p}$ {\it…

Functional Analysis · Mathematics 2021-05-31 Leonid Zelenko

Bent functions, which are maximally nonlinear Boolean functions with even numbers of variables and whose Hamming distance to the set of all affine functions equals $2^{n-1}\pm 2^{\frac{n}{2}-1}$, were introduced by Rothaus in 1976 when he…

Information Theory · Computer Science 2012-05-08 Chunming Tang , Yanfeng Qi , Maozhi Xu , Baocheng Wang , Yixian Yang

We give a new simple construction for known binary quadratic symmetric bent and almost bent functions. In particular, for even number of variables, they are self-dual and anti-self-dual quadratic bent functions, respectively, which are not…

Information Theory · Computer Science 2019-09-24 Josep Rifà , Victor Zinoviev

For 1<p<infty, and weight w in A_p, and function f in L^p(w), we show that the r-variation of the Walsh-Fourier sums are finite, for r sufficiently large as function of w. (That r is a function of w is necessary.) This strengthens a result…

Classical Analysis and ODEs · Mathematics 2012-02-14 Michael T. Lacey , Yen Do

Let $\mathbb{F}_q[t]$ be the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements, and let $p$ be the characteristic of $\mathbb{F}_q$. We denote $\widetilde{G}_q(k)$ to be the least integer $t_0$ with the property that…

Number Theory · Mathematics 2015-09-07 Shuntaro Yamagishi

We introduce the notion of $(\mathcal F,p)$-valent functions. We concentrate in our investigation on the case, where $\mathcal F$ is the class of polynomials of degree at most $s$. These functions, which we call $(s,p)$-valent functions,…

Classical Analysis and ODEs · Mathematics 2015-03-03 Omer Friedland , Yosef Yomdin

APN functions play a central role as building blocks in the design of many block ciphers, serving as optimal functions to resist differential attacks. One of the most important properties of APN functions is their linearity, which is…

Combinatorics · Mathematics 2026-05-19 Sophie Hannah Bénéteau , Nicolas Goluboff , Lukas Kölsch , Divyesh Vaghasiya

Let $p$ be a prime, and let $f(x)$ be an integer-valued polynomial. By a combinatorial approach, we obtain a nontrivial lower bound of the $p$-adic order of the sum $$\sum_{k=r(mod p^{\beta})}\binom{n}{k}(-1)^k f([(k-r)/p^{\alpha}]),$$…

Number Theory · Mathematics 2015-06-26 Zhi-Wei Sun

Classical planar functions are functions from a finite field to itself and give rise to finite projective planes. They exist however only for fields of odd characteristic. We study their natural counterparts in characteristic two, which we…

Combinatorics · Mathematics 2014-01-13 Kai-Uwe Schmidt , Yue Zhou

We consider the problem of bounding the number of exceptional projections (projections which are smaller than typical) of a subset of a vector space over a finite field onto subspaces. We establish bounds that depend on $L^p$ estimates for…

Combinatorics · Mathematics 2025-04-24 Jonathan M. Fraser , Firdavs Rakhmonov

Let $q = p^m$, where $p$ is an odd prime number and $m$ is a positive integer. In this paper, we examine the finite field $\mathbb{F}_{q^2}$, which consists of $q^2$ elements. We first present an alternative method to determine the…

Cryptography and Security · Computer Science 2025-01-15 Sihem Mesnager , Huawei Wu

We consider the function $x^{-1}$ that inverses a finite field element $x \in \mathbb{F}_{p^n}$ ($p$ is prime, $0^{-1} = 0$) and affine $\mathbb{F}_{p}$-subspaces of $\mathbb{F}_{p^n}$ such that their images are affine subspaces as well. It…

Cryptography and Security · Computer Science 2022-07-01 Nikolay Kolomeec , Denis Bykov

The logarithmic convexity of restrictions of the Beta functions to rays parallel to the main diagonal and the functional equation \[ \phi\left( x+1\right) =\frac{x\left( x+k\right) }{\left( 2x+k+1\right) \left( 2x+k\right) }\phi\left(…

Classical Analysis and ODEs · Mathematics 2015-05-07 Martin Himmel , Janu sz Matkowski

Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of $p$-ary linear codes with two or three weights are constructed…

Information Theory · Computer Science 2015-10-20 Zhengchun Zhou , Nian Li , Cuiling Fan , Tor Helleseth

A function $F:\mathbb{F}_2^n\rightarrow \mathbb{F}_2^n$, $n=2m$, can have at most $2^n-2^m$ bent component functions. Trivial examples are obtained as $F(x) = (f_1(x),\ldots,f_m(x),a_1(x),\ldots, a_m(x))$, where…

Number Theory · Mathematics 2020-10-09 Nurdagül Anbar , Tekgül Kalaycı , Wilfried Meidl , László Mérai

Let $p$ be an odd prime, and let $\sum_{n=0}^{\infty} a_{n}X^{n}\in\mathbb{F}_p[[X]]$ be the reduction modulo $p$ of the Artin-Hasse exponential. We obtain a polynomial expression for $a_{kp}$ in terms of those $a_{rp}$ with $r<k$, for even…

Number Theory · Mathematics 2023-08-31 Marina Avitabile , Sandro Mattarei

Let $F$ be an algebraically closed field of characteristic $p>0$. In this paper we develop methods to represent arbitrary elements of $F[t]$ as sums of perfect $k$-th powers for any $k\in\mathbb{N}$ relatively prime to $p$. Using these…

Number Theory · Mathematics 2016-09-06 Seth Dutter , Cole Love

In [GW09a] we conjectured that uniformity of degree $k-1$ is sufficient to control an average over a family of linear forms if and only if the $k$th powers of these linear forms are linearly independent. In this paper we prove this…

Number Theory · Mathematics 2019-06-14 W. T. Gowers , J. Wolf

We study rational functions over finite fields under PGL-equivalence. We say that $f, g \in \Bbb F_q(X)$ are \emph{equivalent} if there exist $\psi, \phi \in \Bbb F_q(X)$ of degree one such that $g = \psi \circ f \circ \phi$. Most…

Number Theory · Mathematics 2026-05-20 Xiang-dong Hou , Siyu Peng , Yongyu Qiang , Shujun Zhao

In this report, we show that all n-variable Boolean function can be represented as polynomial threshold functions (PTF) with at most $0.75 \times 2^n$ non-zero integer coefficients and give an upper bound on the absolute value of these…

Discrete Mathematics · Computer Science 2020-07-07 Erhan Oztop , Minoru Asada