Related papers: On the Bias of Reed-Muller Codes over Odd Prime Fi…

Let $f$ be a polynomial of degree $d$ in $n$ variables over a finite field $\mathbb{F}$. The polynomial is said to be unbiased if the distribution of $f(x)$ for a uniform input $x \in \mathbb{F}^n$ is close to the uniform distribution over…

We study how often exceptional configurations of irreducible polynomials over finite fields occur in the context of prime number races and Chebyshev's bias. In particular, we show that three types of biases, which we call "complete bias",…

We derive simple but nearly tight upper and lower bounds for the binomial lower tail probability (with straightforward generalization to the upper tail probability) that apply to the whole parameter regime. These bounds are easy to compute…

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

Scattered polynomials over finite fields attracted an increasing attention in the last years. One of the reasons is their deep connection with Maximum Rank Distance (MRD) codes. Known classification results for exceptional scattered…

A degree-$d$ polynomial $p$ in $n$ variables over a field $\F$ is {\em equidistributed} if it takes on each of its $|\F|$ values close to equally often, and {\em biased} otherwise. We say that $p$ has a {\em low rank} if it can be expressed…

The classical Reed-Muller codes over a finite field $\mathbb{F}_q$ are based on evaluations of $m$-variate polynomials of degree at most $d$ over a product set $U^m$, for some $d$ less than $|U|$. Because of their good distance properties,…

In this note we prove bounds on the upper and lower probability tails of sums of independent geometric or exponentially distributed random variables. We also prove negative results showing that our established tail bounds are asymptotically…

We provide finite sample upper and lower bounds on the Binomial tail probability which are a direct application of Sanov's theorem. We then use these to obtain high probability upper and lower bounds on the minimum of i.i.d. Binomial random…

We study affine cartesian codes, which are a Reed-Muller type of evaluation codes, where polynomials are evaluated at the cartesian product of n subsets of a finite field F_q. These codes appeared recently in a work by H. Lopez, C.…

We establish upper and lower bounds with matching leading terms for tails of weighted sums of two-sided exponential random variables. This extends Janson's recent results for one-sided exponentials.

Reed-Muller codes consist of evaluations of $n$-variate polynomials over a finite field $\mathbb{F}$ with degree at most $d$. Much like every linear code, Reed-Muller codes can be characterized by constraints, where a codeword is valid if…

We investigate the structure of polynomials of degree four in many variables over a fixed prime field $\mathbb{F}=\mathbb{F}_{p}$. In 2007, Green and Tao proved that if a polynomial $f:\mathbb{F}^{n}\rightarrow\mathbb{F}$ is poorly…

Multivariate multiplicity codes (Kopparty, Saraf, and Yekhanin, J. ACM 2014) are linear codes where the codewords are described by evaluations of multivariate polynomials (with a degree bound) and their derivatives up to a fixed order, on a…

Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…

In this paper non-asymptotic exponential estimates are derived for the tail distribution of polynomial martingale differences in terms unconditional tails distributions of summands. Applications are considered in the theory of polynomials…

We give the proof of a tight lower bound on the probability that a binomial random variable exceeds its expected value. The inequality plays an important role in a variety of contexts, including the analysis of relative deviation bounds in…

We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…

The task of estimation of the tails of probability distributions having small samples seems to be still opened and almost unsolvable. The paper tries to make a step in filling this gap. In 2017 Jordanova et al. introduce six new…

This paper presents new probability inequalities for sums of independent, random, self-adjoint matrices. These results place simple and easily verifiable hypotheses on the summands, and they deliver strong conclusions about the…