21 citations · 32 across the 9 of their papers we have counts for
13 papers
Linear programming bounds for covering radius of spherical designs
Peter Boyvalenkov, Maya Stoyanova
We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardi…
On 3-distance spherical 5-designs
Peter Boyvalenkov, Navid Safaei
Inspired by a recently formulated conjecture by Bannai et al. we investigate spherical codes which admit exactly three different distances and are spherical 5-designs. Computing an…
Binary (k,k)-designs
Todorka Alexandrova, Peter Boyvalenkov, Angel Dimitrov
We introduce and investigate binary -designs -- combinatorial structures which are related to binary orthogonal arrays. We derive general linear programming bound and propos…
Linear programming bounds for spherical (k,k)-designs
Peter Boyvalenkov
We derive general linear programming bounds for spherical -designs. This includes lower bounds for the minimum cardinality and lower and upper bounds for minimum and maximum…
Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances
Peter Boyvalenkov, Peter Dragnev, Douglas Hardin +2
We employ signed measures that are positive definite up to certain degrees to establish Levenshtein-type upper bounds on the cardinality of codes with given minimum and maximum dis…
Upper bounds for energies of spherical codes of given cardinality and separation
Peter Boyvalenkov, Peter Dragnev, Douglas Hardin +2
We introduce a linear programming framework for obtaining upper bounds for the potential energy of spherical codes of fixed cardinality and minimum distance. Using Hermite interpol…