相关论文: Codes in spherical caps
The theory of modular forms and spherical harmonic analysis are applied to establish new best bounds towards the counting and equidistribution of rational points on spheres and other higher dimensional ellipsoids, in what may be viewed as a…
This thesis presents results in quantum error correction within the context of finite dimensional quantum metric spaces. In classical error correction, a focal problem is the study of large codes of metric spaces. For a class of finite…
In the present article, we consider Algebraic Geometry codes on some rational surfaces. The estimate of the minimum distance is translated into a point counting problem on plane curves. This problem is solved by applying the upper bound…
The isoperimetric problem asks for the maximum area of a region of given perimeter. It is natural to consider other measurements of a region, such as the diameter and width, and ask for the extreme value of one when another is fixed. The…
We present a method to obtain upper bounds on covering numbers. As applications of this method, we reprove and generalize results of Rogers on economically covering Euclidean $n$-space with translates of a convex body, or more generally,…
In this paper, we provide the upper bound and the lower bound of the sum of the number of spherical face-partition pair of simple spherical polytope $P$ with $p$ facets.
Subspace codes are the $q$-analog of binary block codes in the Hamming metric. Here the codewords are vector spaces over a finite field. They have e.g. applications in random linear network coding, distributed storage, and cryptography. In…
A covering code is a subset $\mathcal{C} \subseteq \{0,1\}^n$ with the property that any $z \in \{0,1\}^n$ is close to some $c \in \mathcal{C}$ in Hamming distance. For every $\epsilon,\delta>0$, we show a construction of a family of codes…
We establish a general formula for the maximum size of finite length block codes with minimum pairwise distance no less than $d$. The achievability argument involves an iterative construction of a set of radius-$d$ balls, each centered at a…
We establish dihedral quantum codes of short block length, a class of CSS codes obtained by the lifted product construction. We present the code construction and give a formula for the code dimension, depending on the two classical codes…
The color code is both an interesting example of an exactly solved topologically ordered phase of matter and also among the most promising candidate models to realize fault-tolerant quantum computation with minimal resource overhead. The…
We consider the maximum chromatic number of hypergraphs consisting of cliques that have pairwise small intersections. Designs of the appropriate parameters produce optimal constructions, but these are known to exist only when the number of…
Let $\textrm{S}(n,t,k)$ be the maximum size of a code containing only vectors of the $k$th shell of the integer lattice $\mathbb{Z}^n$ such that the inner product between distinct vectors does not exceed $t$. In this paper we compute lower…
Given any full rank lattice and a natural number N , we regard the point set given by the scaled lattice intersected with the unit square under the Lambert map to the unit sphere, and show that its spherical cap discrepancy is at most of…
A spherical two-distance set is a finite collection of unit vectors in $\reals^n$ such that the set of distances between any two distinct vectors has cardinality two. We use the semidefinite programming method to compute improved estimates…
The covering radius problem is a question in coding theory concerned with finding the minimum radius $r$ such that, given a code that is a subset of an underlying metric space, balls of radius $r$ over its code words cover the entire metric…
Consider a $q$-ary block code satisfying the property that no $l$-letters long codeword's prefix occurs as a suffix of any codeword for $l$ inside some interval. We determine a general upper bound on the maximum size of these codes and a…
In this paper, we compare two optimization algorithms using full Hessian and approximation Hessian to obtain numerical spherical designs through their variational characterization. Based on the obtained spherical design point sets, we…
A new inner bound on the capacity region of a general index coding problem is established. Unlike most existing bounds that are based on graph theoretic or algebraic tools, the bound is built on a random coding scheme and optimal decoding,…
An open question about Gabidulin codes is whether polynomial-time list decoding beyond half the minimum distance is possible or not. In this contribution, we give a lower and an upper bound on the list size, i.e., the number of codewords in…