Related papers: Discrepancy bounds for infinite-dimensional order …
The determination of the maximal length of maximum distance separable (MDS) codes arising from elliptic curves is a central problem in coding theory. For an elliptic curve $E$ over $\mathbb{F}_q$, let $\operatorname{MEC}(k,q)$ denote the…
We study the maximum length of $q$-ary codes as a function of alphabet size, code size, and Singleton defect. For an $(n, M, d)_q$ code with dimension $\kappa = \log_q M \ge 2$ and Singleton defect $s = n - \lceil\kappa\rceil + 1 - d$, we…
Maximum distance separable (MDS) are constructed to required specifications. The codes are explicitly given over finite fields with efficient encoding and decoding algorithms. Series of such codes over finite fields with ratio of distance…
Quasi-uniformity is a fundamental geometric property of point sets, crucial for applications such as kernel interpolation, Gaussian process regression, and space-filling experimental designs. While quasi-Monte Carlo methods are widely…
Interpolation inequalities for $C^m$ functions allow to bound derivatives of intermediate order $0 < j<m$ by bounds for the derivatives of order $0$ and $m$. We review various interpolation inequalities for $L^p$-norms ($1 \le p \le…
We calculate the large-q expansion of the second moment correlation length at the first order phase transition point of the q-state Potts model in two dimensions both in the ordered and disordered phases to order 21 in $1/\sqrt{q}$. They…
We establish upper bounds for the size of two-distance sets in Euclidean space and spherical two-distance sets. The main recipe for obtaining upper bounds is the spectral method. We construct Seidel matrices to encode the distance relations…
Motivated by the problem of solving the Einstein equations, we discuss high order finite difference discretizations of first order in time, second order in space hyperbolic systems.Particular attention is paid to the case when first order…
Over the past few decades, there has been extensive research on scattered subspaces, partly because of their link to MRD codes. These subspaces can be characterized using linearized polynomials over finite fields. Within this context,…
We study (symbol-pair) codes for symbol-pair read channels introduced recently by Cassuto and Blaum (2010). A Singleton-type bound on symbol-pair codes is established and infinite families of optimal symbol-pair codes are constructed. These…
Let $q,d\geq 2$ be integers. Define $$ J(q,d):=\frac 1q \Big( \min_{0<x<1} \frac{1-x^q}{1-x} x^{-\frac{q-1}{d}}\Big). $$ Let $\mbox{$\cal G$}\subseteq {\mathbb R}^n$ be an arbitrary subset. We denote by $d(\mbox{$\cal G$})$ the set of…
In the present paper, we study the geometric discrepancy with respect to families of rotated rectangles. The well-known extremal cases are the axis-parallel rectangles (logarithmic discrepancy) and rectangles rotated in all possible…
We use the Haar function system in order to study the $L_2$ discrepancy of a class of digital $(0,n,2)$-nets. Our approach yields exact formulas for this quantity, which measures the irregularities of distribution of a set of points in the…
The aims of this paper are twofold. First, it discusses the Littlewood conjecture and its variants with respect to uniformly distributed sequences. The second aim is to determine the exact order of the discrepancy of the van der…
We study the $L^{\infty}$ discrepancy of point sets generated by determinantal point processes on all compact, connected two-point homogeneous spaces, namely spheres and projective spaces. Using concentration inequalities and variance…
We present families of quantum error-correcting codes which are optimal in the sense that the minimum distance is maximal. These maximum distance separable (MDS) codes are defined over q-dimensional quantum systems, where q is an arbitrary…
The $L_p$-discrepancy is a classical quantitative measure for the irregularity of distribution of an $N$-element point set in the $d$-dimensional unit cube. Its inverse for dimension $d$ and error threshold $\varepsilon \in (0,1)$ is the…
The classical notion of extreme $L_p$ discrepancy is a quantitative measure for the irregularity of distribution of finite point sets in the $d$-dimensinal unit cube. In this paper we find a dual integration problem whose worst-case error…
We prove geometric rigidity inequalities for incompatible fields in dimension higher than 2. We are able to obtain strong scaling-invariant $L^p$ estimates in the supercritical regime, while for critical exponent $1^* = \frac{n}{n-1}$ we…
When using a finite difference method to solve an initial--boundary--value problem, the truncation error is often of lower order at a few grid points near boundaries than in the interior. Normal mode analysis is a powerful tool to analyze…