New LP bounds improve covering radius estimates for binary orthogonal arrays of strength 2k, with algebraic curve lower bounds for specific code families yielding close estimates in some cases.
Stinson, Combinatorial techniques for universal hashing,Journal of Computer and System Sciences, 48, 1994, 337–346
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
New bounds on the covering radius of orthogonal arrays of even strength
New LP bounds improve covering radius estimates for binary orthogonal arrays of strength 2k, with algebraic curve lower bounds for specific code families yielding close estimates in some cases.