4 papers
Quantum channel bounds for constant-composition codes
Artur Akhiiarov, Peter Boyvalenkov, Danila Cherkashin +1
We extend the quantum-channel optimization of Alrabiah and Guruswami to -ary constant-composition codes. We study explicit channel and flag constructions that recover selected c…
A polynomial method over formal power series
Artur Akhiiarov, Mikhail Koshelev, Andrey Kupavskii +1
We give new upper bounds on families of integer vectors with prescribed coordinate multiplicities and a forbidden scalar product. Our method uses coefficient functions over formal…
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…
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…