Results 221 to 230 of about 21,315 (262)
Some of the next articles are maybe not open access.
Constructions for new orthogonal arrays based on large sets of orthogonal arrays
Designs, Codes, and Cryptography, 2023An orthogonal array \(\text{OA}(N,s_{1}^{k_{1}}s_{2}^{k_{2}}\cdots s_{m}^{k_{m}},t)\) is an \(N\times k\) array with \(k=\sum_{j=1}^{m}k_{j}\) in which the first \(k_{1}\) columns have entries from \(\{0,1,2,\dots, s_{1}-1\}\), the next \(k_{2}\) columns have entries from \(\{0,1,2,\dots, s_{2}-1\}\) and so on, with the property that in any \(N\times t\
Guangzhou Chen, Niu Xiaodong
exaly +3 more sources
A new approach in constructing orthogonal and nearly orthogonal arrays
Metrika, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chang-Xing Ma +2 more
exaly +2 more sources
Local equivalence of quantum orthogonal arrays and orthogonal arrays
Quantum Information Processing, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jiao Du +3 more
openaire +2 more sources
Technometrics, 1999
Compound orthogonal arrays have recently been introduced as an alternative to Taguchi's direct product arrays for studying location and dispersion effects simultaneously. In this article, we provide a catalog of two-level compound orthogonal arrays for parameters of most practical interest. The arrays presented possess the maximum possible strength for
A. S. Hedayat, John Stufken
openaire +1 more source
Compound orthogonal arrays have recently been introduced as an alternative to Taguchi's direct product arrays for studying location and dispersion effects simultaneously. In this article, we provide a catalog of two-level compound orthogonal arrays for parameters of most practical interest. The arrays presented possess the maximum possible strength for
A. S. Hedayat, John Stufken
openaire +1 more source
Column-orthogonal strong orthogonal arrays and sliced strong orthogonal arrays
Statistica Sinica, 2015A strong orthogonal array of strength t can achieve uniformity on finer grids when projected onto any g dimensions for any g less than t. It can be regarded as a kind of uniform space-filling design. Meanwhile, orthogonality is also desir- able for space-filling designs.
Haiyan Liu, Min-Qian Liu
openaire +1 more source
Nearly orthogonal arrays mappable into fully orthogonal arrays
Biometrika, 2014We develop a method for construction of arrays which are nearly orthogonal, in the sense that each column is orthogonal to a large proportion of the other columns, and which are convertible to fully orthogonal arrays via a mapping of the symbols in each column to a possibly smaller set of symbols.
Rahul Mukerjee, Fasheng Sun, Boxin Tang
openaire +2 more sources
On Distance Distributions of Orthogonal Arrays
Problems of Information Transmission, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Incomplete orthogonal arrays and idempotent orthogonal arrays
Graphs and Combinatorics, 1996The author introduces a notion of idempotency of orthogonal arrays (OA) of index unity, and the notion of incomplete OA. Denote by \(\text{OA}_\lambda(t,r,s)\) an array with \(r\) rows and \(\lambda s^t\) columns, with entries taken from an \(s\)-set \(E\), such that in each set of \(t\) rows every \(t\)-tuple of entries occurs precisely \(\lambda ...
openaire +1 more source
On Covering Radius of Orthogonal Arrays
2020 Algebraic and Combinatorial Coding Theory (ACCT), 2020We obtain analytically upper bounds for the covering radius of orthogonal arrays (OAs) by investigations of the set of all feasible distance distributions of the corresponding OAs. We apply a procedure for reduction of the possible distance distributions of OA to improve the bound by 1 under certain assumptions.
Silvia P. Boumova +2 more
openaire +1 more source