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...

Full description

Saved in:
Bibliographic Details
Published in:2020 Algebraic and Combinatorial Coding Theory (ACCT) pp. 1 - 6
Main Authors: Boumova, Silvia, Ramaj, Tedis, Stoyanova, Maya
Format: Conference Proceeding
Language:English
Published: IEEE 11.10.2020
Subjects:
Covering Radius
Information theory
Orthogonal Arrays
Upper bound
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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