Related papers: A functional view of upper bounds on codes
We suggest an upper bound on binomial coefficients that holds over the entire parameter range and whose form repeats the form of the de Moivre-Laplace approximation of the symmetric binomial distribution. Using the bound, we estimate the…
We present a method to construct a chain of reproducing kernel Hilbert spaces controlled by a first-order system of differential equations from a given unimodular function satisfying several conditions. One of the applications of that…
Upper bounds are given for the weight distribution of binary weakly self-dual codes. To get these new bounds, we introduce a novel method of utilizing unitary operations on Hilbert spaces. This method is motivated by recent progress on…
We prove lower bounds on the complexity of finding $\epsilon$-stationary points (points $x$ such that $\|\nabla f(x)\| \le \epsilon$) of smooth, high-dimensional, and potentially non-convex functions $f$. We consider oracle-based complexity…
The problem of finding upper bounds for L-functions at the edge of the critical strip has a long and interesting history. Here, the situation for classical L-functions such as Dirichlet L-functions is relatively well understood. The reason…
The statistical distribution of eigenvalues of pairs of coupled random matrices can be expressed in terms of integral kernels having a generalized Christoffel--Darboux form constructed from sequences of biorthogonal polynomials. For…
We consider the inverse boundary value problem of determining a coefficient function in an elliptic partial differential equation from knowledge of the associated Neumann-Dirichlet-operator. The unknown coefficient function is assumed to be…
This paper presents an algebraic approach to characterizing higher-order differential operators. While the foundational Leibniz rule addresses first-order derivatives, its extension to higher orders typically involves identities relating…
The question of what can be computed, and how efficiently, are at the core of computer science. Not surprisingly, in distributed systems and networking research, an equally fundamental question is what can be computed in a…
We show that skew-orthogonal functions, defined with respect to Jacobi weight $w_{a,b}(x)={(1-x)}^a{(1+x)}^b$, $a$, $b>-1$, including the limiting cases of Laguerre ($w_{a}(x)=x^{a}e^{-x}$, $a > -1$) and Gaussian weight ($w(x)=e^{-x^2}$),…
Let $A(n,d,w)$ be the largest possible size of an $(n,d,w)$ constant-weight binary code. By adding new constraints to Delsarte linear programming, we obtain twenty three new upper bounds on $A(n,d,w)$ for $n \leq 28$. The used techniques…
Functions like the exponential, Chebyshev polynomials, and monomial symmetric polynomials are preeminent among all special functions. They have simple definitions and can be expressed using easily specified integers like n!. Families of…
Upper bounds are derived for codes in Stiefel and Grassmann manifolds with given minimal chordal distance. They stem from upper bounds for codes in products of unit spheres and projective spaces. The new bounds are asymptotically better…
We describe an approach to universality limits for orthogonal polynomials on the real line which is completely local and uses only the boundary behavior of the Weyl m-function at the point. We show that bulk universality of the…
For a compact complex manifold endowed with a big line bundle and a Radon measure, we study the localization phenomena of the associated Bergman (or Christoffel-Darboux) kernel. For Bernstein-Markov measures, this results in the…
In this manuscript we deal with existence/uniqueness and regularity issues of suitable weak solutions to nonlocal problems driven by fractional Laplace type operators. Different from previous researches, in our approach we consider gradient…
This paper is concerned with the derivation of computable and guaranteed upper bounds of the difference between the exact and the approximate solution of an exterior domain boundary value problem for a linear elliptic equation. Our analysis…
One of the main problems in random network coding is to compute good lower and upper bounds on the achievable cardinality of the so-called subspace codes in the projective space $\mathcal{P}_q(n)$ for a given minimum distance. The…
For arbitrary planar convex domain, we compute the behavior of Christoffel function up to a constant factor using comparison with other simple reference domains. The lower bound is obtained by constructing an appropriate ellipse contained…
It is a long standing open problem to find search to decision reductions for structured versions of the decoding problem of linear codes. Such results in the lattice-based setting have been carried out using number fields: Polynomial-LWE,…