21 citations · 25 across the 5 of their papers we have counts for
6 papers
On q-ary codes with two distances d and d+1
P. Boyvalenkov, K. Delchev, D. Zinoviev +1
The -ary block codes with two distances and are considered. Several constructions of such codes are given, as in the linear case all codes can be obtained by a simple…
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…
A survey on the kissing numbers
Peter Boyvalenkov, Stefan Dodunekov, Oleg R. Musin
The maximum possible number of non-overlapping unit spheres that can touch a unit sphere in dimensions is called kissing number. The problem for finding kissing numbers is clos…
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…