3 citations · 3 across the 3 of their papers we have counts for
5 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 spherical codes with inner products in a prescribed interval
P. G. Boyvalenkov, P. D. Dragnev, D. P. Hardin +2
We develop a framework for obtaining linear programming bounds for spherical codes whose inner products belong to a prescribed subinterval of . An intricate rela…
Refinements of Levenshtein bounds in -ary Hamming spaces
Peter Boyvalenkov, Danyo Danev, Maya Stoyanova
We develop refinements of the Levenshtein bound in -ary Hamming spaces by taking into account the discrete nature of the distances versus the continuous behavior of certain para…
Nonexistence of a few binary orthogonal arrays
Peter Boyvalenkov, Tanya Marinova, Maya Stoyanova
We develop and apply combinatorial algorithms for investigation of the feasible distance distributions of binary orthogonal arrays with respect to a point of the ambient binary Ham…
Universal lower bounds for potential energy of spherical codes
P. G. Boyvalenkov, P. D. Dragnev, D. P. Hardin +2
We derive and investigate lower bounds for the potential energy of finite spherical point sets (spherical codes). Our bounds are optimal in the following sense -- they cannot be im…