activity
20182026
most citedOn q-ary codes with two distances d and d+1

1 citations · 1 across the 3 of their papers we have counts for

collaborators

5 papers

math.CO2026

Efficient lifts into odd dimensions of Spherical - and -designs with Balanced Halves

Konstantin Delchev, Boryan Yordanov

We propose constructions of spherical - and -designs in odd dimensions by lifting balanced halves of even-dimensional designs to several layers of suitable latitudes. For eve…

math.CO2026

The 2-Adic Valuation of the Order of the All-Ones Class in the Sandpile Group of a Square

Turgay Akyar, Artem Beliakov, Konstantin Delchev +6

Place one grain at every nonsink vertex of the wired square, and let be the order of this operation in the sandpile group. Thus is the least positive …

cs.IT2020

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…

cs.IT2019★ 1 cited

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…

math.CO2018

Upper Energy Bounds for Spherical Designs of Relatively Small Cardinalities

Peter Boyvalenkov, Konstantin Delchev, Matthieu Jourdain

We derive upper bounds for the potential energy of spherical designs of cardinality close to the Delsarte-Goethals-Seidel bound. These bounds are obtained by linear programming wit…