Bounds for Codes by Semidefinite Programming
| dc.creator | Musin, Oleg R. | |
| dc.date | 2006-09-05 | |
| dc.date | 2008-07-01 | |
| dc.date.accessioned | 2026-07-07T12:26:47Z | |
| dc.date.available | 2026-07-07T12:26:47Z | |
| dc.description | Delsarte's method and its extensions allow to consider the upper bound problem for codes in 2-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 to improve some linear programming upper bounds. In particular we obtain new bounds of one-sided kissing numbers. | |
| dc.description | 20 pages | |
| dc.identifier | https://arxiv.org/abs/math/0609155 | |
| dc.identifier | http://arxiv.org/abs/math/0609155 | |
| dc.identifier | Proc. Steklov Inst. Math., 263 (2008), 134-149. | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/214993 | |
| dc.subject | Combinatorics | |
| dc.subject | Metric Geometry | |
| dc.title | Bounds for Codes by Semidefinite Programming | |
| dc.type | text |