21 citations · 48 across the 26 of their papers we have counts for
5 papers · 1 filter
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…
On two-weight codes
P. G. Boyvalenkov, K. V. Delchev, D. V. Zinoviev +1
We consider -ary (linear and nonlinear) block codes with exactly two distances: and . Several combinatorial constructions of optimal such codes are given. In the linear…
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…