2 papers
cs.IT2026
Envelopes of upper bounds for nonbinary constant-weight and constant-composition codes
Artur Akhiiarov, Peter Boyvalenkov, Danila Cherkashin +1
Deriving upper bounds on code size from existing bounds is a classical approach in coding theory, dating back to the seminal results of Elias, Bassalygo, and Levenshtein. We study…
math.CO2024
Lower bounds on the independence numbers of distance graphs with vertices in
A. R. Akhiiarov, A. V. Bobu, A. M. Raigorodskii
This work is devoted to lower bounds on independence numbers of distance graphs with vertices in . The asymptotic case is studied, yielding new results over a broad r…