Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Bounds for the Minimum Distance and Covering Radius of Orthogonal Arrays via Their Distance Distributions

Version 1 : Received: 16 December 2021 / Approved: 17 December 2021 / Online: 17 December 2021 (15:49:57 CET)

How to cite: Boumova, S.; Boyvalenkov, P.; Stoyanova, M. Bounds for the Minimum Distance and Covering Radius of Orthogonal Arrays via Their Distance Distributions. Preprints 2021, 2021120293 (doi: 10.20944/preprints202112.0293.v1). Boumova, S.; Boyvalenkov, P.; Stoyanova, M. Bounds for the Minimum Distance and Covering Radius of Orthogonal Arrays via Their Distance Distributions. Preprints 2021, 2021120293 (doi: 10.20944/preprints202112.0293.v1).

Abstract

We propose two methods for obtaining estimations on the minimum distance and covering radius of orthogonal arrays. Both methods are based on knowledge about the (feasible) sets of distance distributions of orthogonal arrays with given length, cardinality, factors and strength. New bounds are presented either in analytic form and as products of an ongoing project for computation and investigation of the possible distance distributions of orthogonal arrays with parameters in doable ranges.

Keywords

Orthogonal Arrays; Distance distributions; Minimum distance; Covering radius

Subject

MATHEMATICS & COMPUTER SCIENCE, Applied Mathematics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.