Semidefinite programming in combinatorial optimization with applications to coding theory and geometry
We apply the semidefinite programming method to obtain a new upper bound on the cardinality of codes made of subspaces of a linear vector space over a finite field. Such codes are of interest in network coding.Next, with the same method, we prove an upper bound on the cardinality of sets avoiding on...
| Main Author: | |
|---|---|
| Language: | ENG |
| Published: |
Université Sciences et Technologies - Bordeaux I
2013
|
| Subjects: | |
| Online Access: | http://tel.archives-ouvertes.fr/tel-00948055 http://tel.archives-ouvertes.fr/docs/00/94/80/55/PDF/PASSUELLO_ALBERTO_2013.pdf |