相关论文: Asymptotic optimality of scalar Gersho quantizers
Many asymptotic formulas exist for unrestricted integer partitions as well as for distinct partitions of integers into a finite number of parts. Szekeres and Canfield have derived an asymptotic formula for the number of partitions that is…
Schur introduced the problem on the smallest limit point for the arithmetic means of totally positive conjugate algebraic integers. This area was developed further by Siegel, Smyth and others. We consider several generalizations of the…
The error coefficient of a linear code is defined as the number of minimum-weight codewords. In an additive white Gaussian noise channel, optimal linear codes with the smallest error coefficients achieve the best possible asymptotic frame…
Using algebraic geometry codes we give a polynomial construction of quantum codes with asymptotically non-zero rate and relative distance.
An important problem in geometric quantization is that of quantizing certain classes of Lagrangian submanifolds, so-called Bohr-Sommerfeld Lagrangian submanifolds, equipped with a smooth half-density. A procedure for this in the complex…
We present two short proofs giving the best known asymptotic lower bound for the maximum element in a set of $n$ positive integers with distinct subset sums.
Group codes are right or left ideals in a group algebra of a finite group over a finite field. Following ideas of Bazzi and Mitter on group codes over the binary field, we prove that group codes over finite fields of any characteristic are…
Scalarization in vector optimization is essentially based on the minimization of Gerstewitz functionals. In this paper, the minimizer sets of Gerstewitz functionals are investigated. Conditions are given under which such a set is nonempty…
In this paper, we investigate the problem of classifying feature vectors with mutually independent but non-identically distributed elements. First, we show the importance of this problem. Next, we propose a classifier and derive an…
Codebooks are required to have small inner-product correlation in many practical applications, such as direct spread code division multiple access communications, space-time codes and compressed sensing. In general, it is difficult to…
In this paper, we prove the first asymptotic completeness result for a scalar quasilinear wave equation satisfying the weak null condition. The main tool we use in the study of this equation is the geometric reduced system introduced in…
Quasisymmetric stellarators are an attractive class of optimised magnetic confinement configurations. The property of quasisymmetry (QS) is in practice limited to be approximate, and thus the construction requires measures that quantify the…
In this paper, we consider asymptotics of the optimal value and the optimal solutions of parametric minimax estimation problems. Specifically, we consider estimators of the optimal value and the optimal solutions in a sample minimax problem…
A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field was recently presented in [10]. Shortly after this, a generalization for the sufficient numerical conditions of such characterization…
We study the problem of approximating the quality of a disperser. A bipartite graph $G$ on $([N],[M])$ is a $(\rho N,(1-\delta)M)$-disperser if for any subset $S\subseteq [N]$ of size $\rho N$, the neighbor set $\Gamma(S)$ contains at least…
In this paper we study the asymptotic properties of point configurations that achieve optimal covering of sets lacking smoothness. Our results include the proofs of the existence of asymptotics of best covering and maximal polarization for…
The problem of designing optimal quantization rules for sequential detectors is investigated. First, it is shown that this task can be solved within the general framework of active sequential detection. Using this approach, the optimal…
In Euclidean space, the asymptotic shape of large cells in various types of Poisson driven random tessellations has been the subject of a famous conjecture due to David Kendall. Since shape is a geometric concept and large cells are…
Vector sets with optimal coherence according to the Welch bound cannot exist for all pairs of dimension and cardinality. If such an optimal vector set exists, it is an equiangular tight frame and represents the solution to a Grassmannian…
In this paper, an approximation of the optimal compressor function using the quadratic spline functions has been presented. The coefficients of the quadratic spline functions are determined by minimizing the mean-square error (MSE). Based…