Showing cs.ITShow all
3 papers · 1 filter
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…
cs.IT2026
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…
cs.IT2025
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…