Related papers: On minimal distance between q-ary bent functions

For any finite field ${\mathbb F}_q$ with $q$ elements, we study the set ${\mathcal F}_{(q,m)}$ of functions from ${\mathbb F}_q^m$ into ${\mathbb F}^q$. We introduce a transformation that allows us to determine a linear system of $q^{m+1}$…

We study the footprint function, with respect to a monomial order, of complete intersection graded ideals in a polynomial ring with coefficients in a field. For graded ideals of dimension one, whose initial ideal is a complete intersection,…

We consider a modification of the classical number theoretic question about the gaps between consecutive primitive roots modulo a prime $p$, which by the well-known result of Burgess are known to be at most $p^{1/4+o(1)}$. Here we measure…

We introduce and study the minimum distance function of a graded ideal in a polynomial ring with coefficients in a field, and show that it generalizes the minimum distance of projective Reed-Muller-type codes over finite fields. This gives…

We study the arity gap of functions of several variables defined on an arbitrary set A and valued in another set B. The arity gap of such a function is the minimum decrease in the number of essential variables when variables are identified.…

In this paper, we describe the properties of the $i$-components of Hamming codes. We suggest constructions of the admissible families of components of Hamming codes. It is shown that every $q$-ary code of length $m$ and minimum distance 5…

The Walsh--Hadamard spectrum of a bent function uniquely determines a dual function. The dual of a bent function is also bent. A bent function that is equal to its dual is called a self-dual function. The Hamming distance between a bent…

Given an $n$-ary $k-$valued function $f$, $gap(f)$ denotes the minimal number of essential variables in $f$ which become fictive when identifying any two distinct essential variables in $f$. We particularly solve a problem concerning the…

The authors' previous results on the arity gap of functions of several variables are refined by considering polynomial functions over arbitrary fields. We explicitly describe the polynomial functions with arity gap at least 3, as well as…

Let $P(a,q)$ be the least prime in the arithmetic progression $\{n\equiv a(mod\ q)\}$. In this note, when $q$ has bounded cubic part and $(a,q)=1$, we combine the Heath-Brown's method and the Burgess's bounds for L-functions to obtain $…

The binary divergences that are divergences between probability measures defined on the same 2-point set have an interesting property. For the chi-squared divergence and the relative entropy, it is known that their binary divergence attain…

Let $\cal{P}$ be an affine invariant property of functions $\mathbb{F}_p^n \to [R]$ for fixed $p$ and $R$. We show that if $\cal{P}$ is locally testable with a constant number of queries, then one can estimate the distance of a function $f$…

Let $p$ and $q$ be anisotropic quadratic forms over a field $F$ of characteristic $\neq 2$, let $s$ be the unique non-negative integer such that $2^s < \mathrm{dim}(p) \leq 2^{s+1}$, and let $k$ denote the dimension of the anisotropic part…

We obtain an explicit criterion for $p$-ary functions to produce association schemes in terms of their Walsh spectrum. Employing this characterization, we explicitly find a correlation between $p$-ary bent functions and association schemes;…

In this paper, we obtain a new class of $p$-ary binomial bent functions which are determined by Kloosterman sums. The bentness of another three classes of functions is characterized by some exponential sums and some results in…

A function $f: \mathbb{Z} \to \mathbb{Q}^n$ is a $c$-quasihomomorphism if the Hamming distance between $f(x+y)$ and $f(x)+f(y)$ is at most $c$ for all $x,y \in \mathbb{Z}$. We show that any $c$-quasihomomorphism has distance at most some…

The number of essentially different square polyominoes of order n and minimum perimeter p(n) is enumerated.

Let x, y be strings of equal length. The Hamming distance h(x,y) between x and y is the number of positions in which x and y differ. If x is a cyclic shift of y, we say x and y are conjugates. We consider f(x,y), the Hamming distance…

For each $d>0$, we find all the smallest fullerenes for which the least distance between two pentagons is $d$. We also show that for each $d$ there is an $h_d$ such that fullerenes with pentagons at least distance $d$ apart and any number…

Let $p$ be a fixed prime. For a finite group generated by elements of order $p$, the $p$-width is defined to be the minimal $k\in\mathbb{N}$ such that any group element can be written as a product of at most $k$ elements of order $p$. Let…