3 papers
cs.IT2025
Evaluation Codes in Bottleneck Metrics
Mahir Bilen Can, Dillon Montero, Ferruh Özbudak
Analogs of Reed-Solomon codes are introduced within the framework of bottleneck poset metrics. These codes are proven to be maximum distance separable. Furthermore, the results are…
math.CO2024
Generalizing the Bierbrauer-Friedman bound for orthogonal arrays
Denis S. Krotov, Ferruh Özbudak, Vladimir N. Potapov
We characterize mixed-level orthogonal arrays in terms of algebraic designs in a special multigraph. We prove a mixed-level analog of the Bierbrauer-Friedman (BF) bound for pure-le…
cs.IT2018
Subspace Packings
Tuvi Etzion, Sascha Kurz, Kamil Otal +1
The Grassmannian is the set of all -dimensional subspaces of the vector space . It is well known that codes in the Grassmannian space can b…