On Covering Radius of Orthogonal Arrays

We obtain analytically upper bounds for the covering radius of orthogonal arrays (OAs) by investigations of the set of all feasible distance distributions of the corresponding OAs. We apply a procedure for reduction of the possible distance distributions of OA to improve the bound by 1 under certain...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2020 Algebraic and Combinatorial Coding Theory (ACCT) s. 1 - 6
Hlavní autoři: Boumova, Silvia, Ramaj, Tedis, Stoyanova, Maya
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 11.10.2020
Témata:
Covering Radius
Information theory
Orthogonal Arrays
Upper bound
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We obtain analytically upper bounds for the covering radius of orthogonal arrays (OAs) by investigations of the set of all feasible distance distributions of the corresponding OAs. We apply a procedure for reduction of the possible distance distributions of OA to improve the bound by 1 under certain assumptions. Examples of OAs attaining and close to our bounds are shown.
DOI:10.1109/ACCT51235.2020.9383398