|
Trudy Matematicheskogo Instituta imeni V.A. Steklova, 2008, Volume 263, Pages 143–158
(Mi tm789)
|
|
|
|
This article is cited in 9 scientific papers (total in 9 papers)
Bounds for Codes by Semidefinite Programming
O. R. Musin Department of Mathematics, University of Texas at Brownsville
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.
Received in August 2008
Citation:
O. R. Musin, “Bounds for Codes by Semidefinite Programming”, Geometry, topology, and mathematical physics. I, Collected papers. Dedicated to Academician Sergei Petrovich Novikov on the occasion of his 70th birthday, Trudy Mat. Inst. Steklova, 263, MAIK Nauka/Interperiodica, Moscow, 2008, 143–158; Proc. Steklov Inst. Math., 263 (2008), 134–149
Linking options:
https://www.mathnet.ru/eng/tm789 https://www.mathnet.ru/eng/tm/v263/p143
|
Statistics & downloads: |
Abstract page: | 274 | Full-text PDF : | 70 | References: | 44 | First page: | 5 |
|