Bounds for binary codes relative to pseudo-distances of k points
We apply Schrijver's semidefinite programming method to obtain improved upper bounds on generalized distances and list decoding radii of binary codes.
cs.IT↗
arXiv subjects
Christine Bachoc
Publications and source records attributed to Christine Bachoc.
Lower bounds for measurable chromatic numbers
The Lovasz theta function provides a lower bound for the chromatic number of finite graphs based on the solution of a semidefinite program. In this paper we generalize it so that it gives a lower bound for the measurable chromatic number of distance graphs on compact metric spaces. In particular we consider distance graphs on the unit sphere. There we transform the original infinite semidefinite program into an infinite linear program which then turns out to be an extremal question about Jacobi polynomials which we solve explicitly in the limit. As an application we derive new lower bounds for the measurable chromatic number of the Euclidean space in dimensions 10,..., 24, and we give a new proof that it grows exponentially with the dimension.
math.CO↗
Optimality and uniqueness of the (4,10,1/6) spherical code
Linear programming bounds provide an elegant method to prove optimality and uniqueness of an (n,N,t) spherical code. However, this method does not apply to the parameters (4,10,1/6). We use semidefinite programming bounds instead to show that the Petersen code, which consists of the midpoints of the edges of the regular simplex in dimension 4, is the unique (4,10,1/6) spherical code.
math.MG↗
Designs, groups and lattices
We study the Grassmannian 4-designs contained in lattices, in connection with the local property of the Rankin constant. We prove that the sequence of Barnes-Wall lattices contain Grassmannian 6-designs.
math.NT↗
Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
We apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obtain new upper bounds for codes in spherical caps. We compute new upper bounds for the one-sided kissing number in several dimensions where we in particular get a new tight bound in dimension 8. Furthermore we show how to use the SDP framework to get analytic bounds.
math.MG↗
New upper bounds for kissing numbers from semidefinite programming
Recently A. Schrijver derived new upper bounds for binary codes using semidefinite programming. In this paper we adapt this approach to codes on the unit sphere and we compute new upper bounds for the kissing number in several dimensions. In particular our computations give the (known) values for the cases n = 3, 4, 8, 24.
math.MG↗
Bounds for codes in products of spaces, Grassmann and Stiefel manifolds
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 than the previously known ones.
math.CO↗
Linear programming bounds for codes in Grassmannian spaces
We introduce a linear programming method to obtain bounds on the cardinality of codes in Grassmannian spaces for the chordal distance. We obtain explicit bounds, and an asymptotic bound that improves on the Hamming bound. Our approach generalizes the approach originally developed by P. Delsarte and Kabatianski-Levenshtein for compact two-point homogeneous spaces.
math.CO↗