相关论文: Improved Delsarte bounds for spherical codes in sm…

We develop a new family of linear programs, that yield upper bounds on the rate of binary linear codes of a given distance. Our bounds apply {\em only to linear codes.} Delsarte's LP is the weakest member of this family and our LP yields…

We improve the previously best known upper bounds on the sizes of $\theta$-spherical codes for every $\theta<\theta^*\approx 62.997^{\circ}$ at least by a factor of $0.4325$, in sufficiently high dimensions. Furthermore, for sphere packing…

This paper investigates the behaviour of the kissing number $\kappa(n, r)$ of congruent radius $r > 0$ spheres in $\mathbb{S}^n$, for $n\geq 2$. Such a quantity depends on the radius $r$, and we plot the approximate graph of $\kappa(n, r)$…

Let $A(n, d)$ denote the maximum size of a binary code of length $n$ and minimum Hamming distance $d$. Studying $A(n, d)$, including efforts to determine it as well to derive bounds on $A(n, d)$ for large $n$'s, is one of the most…

Polynomial, or Delsarte's, method in coding theory accounts for a variety of structural results on, and bounds on the size of, extremal configurations (codes and designs) in various metric spaces. In recent works of the authors the…

A central and longstanding open problem in coding theory is the rate-versus-distance trade-off for binary error-correcting codes. In a seminal work, Delsarte introduced a family of linear programs establishing relaxations on the size of…

We derive and investigate lower bounds for the potential energy of finite spherical point sets (spherical codes). Our bounds are optimal in the following sense -- they cannot be improved by employing polynomials of the same or lower degrees…

We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through…

We derive improved bounds on the error and erasure rate for spherical codes and for binary linear codes under Forney's erasure/list decoding scheme and prove some related results.

New bounds on the cardinality of permutation codes equipped with the Ulam distance are presented. First, an integer-programming upper bound is derived, which improves on the Singleton-type upper bound in the literature for some lengths.…

We derive upper and lower bounds on the sum of distances of a spherical code of size $N$ in $n$ dimensions when $N\sim n^\alpha, 0<\alpha\le 2.$ The bounds are derived by specializing recent general, universal bounds on energy of spherical…

Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. Here we collect the present knowledge on lower and upper bounds for binary subspace codes for…

We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show…

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…

Based on the Delsarte-Yudin linear programming approach, we extend Levenshtein's framework to obtain lower bounds for the minimum $h$-energy of spherical codes of prescribed dimension and cardinality, and upper bounds on the maximal…

We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values.

We study the Delsarte problem for even functions continuous on [-1,1], nonpositive on [-1/2,1/2], and representable as series with respect to the ultraspherical polynomials. The value of the Delsarte problem gives an upper bound for the…

A generalization of highly symmetric frames is presented by considering also projective stabilizers of frame vectors. This allows construction of highly symmetric line systems and study of highly symmetric frames in a more unified manner.…

We derive general linear programming bounds for spherical $(k,k)$-designs. This includes lower bounds for the minimum cardinality and lower and upper bounds for minimum and maximum energy, respectively. As applications we obtain a universal…

We introduce a decoder for the 3D color code with boundaries, which is a variation of the restriction decoder introduced by Kubicka and Delfosse. Specifically, we adapt the lift procedure to efficiently find a correction on qubits adjacent…