Add to ORKGOrthogonal arrays (OAs) are basic combinatorial structures, which appear under various disguises in cryptology and the theory of algorithms. Among their applications are universal hashing, authentication codes, resilient and correlation-immune functions, derandomization of algorithms, and perfect local randomizers. In this paper, we give new bounds on the size of orthogonal arrays using Delsarte's linear programming method. Then we derive bounds on resilient functions and discuss when these bounds can be met
Mixed-level orthogonal arrays are basic structures in experimental design. We develop three algorith...
We generate all the Orthogonal Arrays (OAs) of a given size n and strength t as the union of a colle...
Based on a self-contained account of the classical linear programming bounds for codes and orthogona...
Orthogonal arrays (OAs) are basic combinatorial structures, which appear under various disguises in ...
Orthogonal arrays (OAs) are basic combinatorial structures, which appear under various disguises in ...
Orthogonal arrays (OAs) are basic combinatorial structures, which appear under various disguises in ...
The only known general bounds on the parameters of orthogonal arrays are those given by Rao in 1947 ...
Abstract. Orthogonal arrays (OAs) are basic combinatorial structures, originally studied by statisti...
For every prime-power q and n≥m we construct orthogonal arrays OA(t,qn + [n/m],qm) (2≤t≤qn). If qm ...
Recent years have seen numerous examples where designs play an important role in the study of such t...
Recent years have seen numerous examples when designs play an important role in the study of such to...
In this expository note, we exhibit a duality between linear programming bounds for codes and orthog...
Recent years have seen numerous examples when designs play an important role in the study of such to...
We prove a quantum query lower bound Ω(n(d+1)/(d+2)) for the problem of deciding whether an input st...
A new construction for orthogonal arrays of strength 3 is given. 1 Introduction An orthogonal array...
Mixed-level orthogonal arrays are basic structures in experimental design. We develop three algorith...
We generate all the Orthogonal Arrays (OAs) of a given size n and strength t as the union of a colle...
Based on a self-contained account of the classical linear programming bounds for codes and orthogona...
Orthogonal arrays (OAs) are basic combinatorial structures, which appear under various disguises in ...
Orthogonal arrays (OAs) are basic combinatorial structures, which appear under various disguises in ...
Orthogonal arrays (OAs) are basic combinatorial structures, which appear under various disguises in ...
The only known general bounds on the parameters of orthogonal arrays are those given by Rao in 1947 ...
Abstract. Orthogonal arrays (OAs) are basic combinatorial structures, originally studied by statisti...
For every prime-power q and n≥m we construct orthogonal arrays OA(t,qn + [n/m],qm) (2≤t≤qn). If qm ...
Recent years have seen numerous examples where designs play an important role in the study of such t...
Recent years have seen numerous examples when designs play an important role in the study of such to...
In this expository note, we exhibit a duality between linear programming bounds for codes and orthog...
Recent years have seen numerous examples when designs play an important role in the study of such to...
We prove a quantum query lower bound Ω(n(d+1)/(d+2)) for the problem of deciding whether an input st...
A new construction for orthogonal arrays of strength 3 is given. 1 Introduction An orthogonal array...
Mixed-level orthogonal arrays are basic structures in experimental design. We develop three algorith...
We generate all the Orthogonal Arrays (OAs) of a given size n and strength t as the union of a colle...
Based on a self-contained account of the classical linear programming bounds for codes and orthogona...