21 citations · 32 across the 10 of their papers we have counts for
6 papers · 1 filter
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…
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…
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…
Linear Programming Bounds
Peter Boyvalenkov, Danyo Danev
This chapter is written for the forthcoming book "A Concise Encyclopedia of Coding Theory" (CRC press), edited by W. Cary Huffman, Jon-Lark Kim, and Patrick Solé. This book will co…
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…