Bounds for codes by semidefinite programming |
| |
Authors: | O. R. Musin |
| |
Affiliation: | (1) Department of Mathematics, University of Texas at Brownsville, 80 Fort Brown, Brownsville, TX 78520, USA |
| |
Abstract: | Delsarte’s method and its extensions allow one to consider the upper bound problem for codes in two-point homogeneous spaces as a linear programming problem with perhaps infinitely many variables, which are the distance distribution. We show that using as variables power sums of distances, this problem can be considered as a finite semidefinite programming problem. This method allows one to improve some linear programming upper bounds. In particular, we obtain new bounds of one-sided kissing numbers. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|