5 citations · 8 across the 8 of their papers we have counts for
4 papers · 1 filter
New bounds on the covering radius of orthogonal arrays of even strength
Peter Boyvalenkov, Ferruh Ozbudak, Maya Stoyanova
We obtain new linear programming (LP) and constructive bounds for the covering radius of binary orthogonal arrays of strength . Our LP bounds develop in two alternative scenari…
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…
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…