Estimates of the capacity of orthogonal arrays of large strength |
| |
| Authors: | A V Khalyavin |
| |
| Institution: | (1) Department of Computer Science, University of Georgia, Athens, GA 30602, USA;(2) School of Mathematics and Statistics, Carleton University, Ottawa, ON, Canada;(3) School of Mathematics and Statistics, University of New South Wales, Sydney, Australia, 2052;(4) School of Computer Science, Australian National University, Canberra, ACT, Australia |
| |
| Abstract: | D.G. Fon-Der-Flaass showed that Boolean correlation-immune n-variable functions of order m are resilient for $
m \geqslant \frac{{2n - 2}}
{3}
$
m \geqslant \frac{{2n - 2}}
{3}
. In this paper this theorem is generalized to orthogonal arrays. It is shown that orthogonal arrays of strength m not less than $
\frac{{2n - 2}}
{3}
$
\frac{{2n - 2}}
{3}
, where n is a number of factors having size at least 2
n−1 and all arrays of size 2
n−1, are simple. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
