4 papers
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…
Some structural properties of mixed orthogonal arrays and their irredundancy
Maryam Bajalan, Peter Boyvalenkov, Ferruh Özbudak
Mixed (asymmetric) orthogonal arrays (MOAs) generalize classical orthogonal arrays by allowing columns over different alphabets. However, their study requires very different struct…
On irredundant orthogonal arrays
Maryam Bajalan, Peter Boyvalenkov
An orthogonal array (OA), denoted by , is an matrix over an alphabet of size such that every selection of columns contains each possible…
Growth of masses of crystalline measures
Peter Boyvalenkov, Sergii Yu. Favorov
Let be a measure on the Euclidean space of unbounded total variation that is positive or translation bounded and has a pure point Fourier transform in the sense of distr…