Related papers: On q-ary Bent and Plateaued Functions
Let $[a,b]\subset\mathbb{R}$ be a non empty and non singleton closed interval and $P=\{a=x_0<\cdots<x_n=b\}$ is a partition of it. Then $f:I\to\mathbb{R}$ is said to be a function of $r$-bounded variation, if the expression…
The length function $\ell_q(r,R)$ is the smallest length of a $ q $-ary linear code with codimension (redundancy) $r$ and covering radius $R$. In this work, new upper bounds on $\ell_q(tR+1,R)$ are obtained in the following forms:…
Bent functions are balanced by restricting their domains to vectors with either even or odd Hamming weights, which ensures an equal number of pre-images for both, 0 and 1. Using the previous fact, we can construct bent functions on two…
We present necessary and sufficient conditions for a Boolean function to be a negabent function for both even and odd number of variables, which demonstrate the relationship between negabent functions and bent functions. By using these…
We give examples of $L^{1}$-functions that are essentially unbounded on every nonempty open subset of their domains of definition. We obtain such functions as limits of weighted sums of functions with the unboundedly increasing number of…
The length function $\ell_q(r,R)$ is the smallest possible length $n$ of a $ q $-ary linear $[n,n-r]_qR$ code with codimension (redundancy) $r$ and covering radius $R$. Let $s_q(N,\rho)$ be the smallest size of a $\rho$-saturating set in…
It is well known that a quadratic function defined on a finite field of odd degree is almost bent (AB) if and only if it is almost perfect nonlinear (APN). For the even degree case there is no apparent relationship between the values in the…
Consider $q_n$ a random pointed quadrangulation chosen equally likely among the pointed quadrangulations with $n$ faces. In this paper we show that, when $n$ goes to $+\infty$, $q_n$ suitably normalized converges weakly in a certain sense…
For each $n\in\mathbb{N}$, let $\mathbf{Q}_n$ be a uniform rooted measured quadrangulation of size $n$ conditioned to have $r(n)$ vertices in its root block. We prove that for a suitable function $r(n)$, after rescaling graph distance by…
Linear codes with a few weights are an important class of codes in coding theory and have attracted a lot of attention. In this paper, we present several constructions of $q$-ary linear codes with two or three weights from vectorial…
We obtain a sharp $L^2\times L^2 \to L^1$ boundedness criterion for a class of bilinear operators associated with a multiplier given by a signed sum of dyadic dilations of a given function, in terms of the $L^q$ integrability of this…
The purpose of this article is twofold. First, we prove that the squeezing function approaches 1 near strongly pseudoconvex boundary points of bounded domains in $\mathbb{C}^{n+1}$. Second, we show that the squeezing function approaches 1…
We consider the partial theta function $\theta (q,z):=\sum _{j=0}^{\infty}q^{j(j+1)/2}z^j$, where $(q,z)\in \mathbb{C}^2$, $|q|<1$. We show that for any $0<\delta _0<\delta <1$, there exists $n_0\in \mathbb{N}$ such that for any $q$ with…
In this article, we obtain explicit bounds on the uniform distance between the cumulative distribution function of a standardized sum $S_n$ of $n$ independent centered random variables with moments of order four and its first-order…
A complex tensor with $n$ binary indices can be identified with a multilinear polynomial in $n$ complex variables. We say it is a Lee-Yang tensor with radius $r$ if the polynomial is nonzero whenever all variables lie in the open disk of…
We provide detailed local descriptions of stable polynomials in terms of their homogeneous decompositions, Puiseux expansions, and transfer function realizations. We use this theory to first prove that bounded rational functions on the…
Constructions of quantum MDS codes have been studied by many authors. We refer to the table in page 1482 of [3] for known constructions. However there are only few $q$-ary quantum MDS $[[n,n-2d+2,d]]_q$ codes with minimum distances…
Bent functions are maximally nonlinear Boolean functions with an even number of variables, which include a subclass of functions, the so-called hyper-bent functions whose properties are stronger than bent functions and a complete…
Let A(q,n,d) denote the maximum size of a q-ary code of length n and distance d. We study the minimum asymptotic redundancy \rho(q,n,d)=n-log_q A(q,n,d) as n grows while q and d are fixed. For any d and q<=d-1, long algebraic codes are…
Two classes of ternary bent functions of degree four with two and three terms in the univariate representation that belong to the completed Maiorana-McFarland class are found. Binomials are mappings $\F_{3^{4k}}\mapsto\fthree$ given by…