An equivalence between (T, M, S)-nets and strongly orthogonal hypercubes
Journal of Combinatorial Theory Series A
Split Orthogonal Arrays and Maximum Independent ResilientSystems of Functions
Designs, Codes and Cryptography
Construction of digital (t,m,s)-nets from linear codes
FFA '95 Proceedings of the third international conference on Finite fields and applications
Elements of prescribed order, prescribed traces and systems of rational functions over finite fields
Designs, Codes and Cryptography
Finite Field Elements with Specified Order and Traces
Designs, Codes and Cryptography
A Family of Binary (t, m,s)-Nets of Strength 5
Designs, Codes and Cryptography
Constructions of (t ,m,s)-nets and (t,s)-sequences
Finite Fields and Their Applications
Hi-index | 0.00 |
An ordered orthogonal array OOA(τ, k, n) is a binary 2k × nτ matrix with the property that for each complete τ-set of columns, each possible τ-tuple occurs in exactly 2k−τ rows of those columns (for definition of a complete τ-set, see below). Constructions of OOA(τ, k, n) for τ = 4 and τ = 5 are given.