Results 1 to 10 of about 122,515 (169)
Generalized binary arrays from quasi-orthogonal cocycles [PDF]
, 2020 Generalized perfect binary arrays (GPBAs) were used by Jedwab to construct perfect binary arrays. A non-trivial GPBA can exist only if its energy is 2 or a multiple of 4. This paper introduces generalized optimal binary arrays (GOBAs) with even energy
Armario Sampalo, José Andrés +1 more
core +2 more sources
Difference Covering Arrays and Pseudo-Orthogonal Latin Squares [PDF]
, 2015 Difference arrays are used in applications such as software testing, authentication codes and data compression. Pseudo-orthogonal Latin squares are used in experimental designs.
Demirkale, Fatih +4 more
core +2 more sources
Generalized resolution for orthogonal arrays [PDF]
, 2014 The generalized word length pattern of an orthogonal array allows a ranking of orthogonal arrays in terms of the generalized minimum aberration criterion (Xu and Wu [Ann. Statist. 29 (2001) 1066-1077]).
Grömping, Ulrike, Xu, Hongquan
core +1 more source
Efficient decoupling schemes with bounded controls based on Eulerian orthogonal arrays [PDF]
, 2004 The task of decoupling, i.e., removing unwanted interactions in a system Hamiltonian and/or couplings with an environment (decoherence), plays an important role in controlling quantum systems.
A. S. Hedayat +5 more
core +2 more sources
3-Uniform states and orthogonal arrays [PDF]
, 2015 In a recent paper (Phys. Rev. A 90, 022316 (2014) ), Goyeneche et al. established a link between the combinatorial notion of orthogonal arrays and k-uniform states and present open issue. (B) Find for what N there are 3-uniform states of N-qubits.
Ahmed, Irfan +2 more
core +3 more sources
The Lattice of N-Run Orthogonal Arrays [PDF]
, 2002 If the number of runs in a (mixed-level) orthogonal array of strength 2 is specified, what numbers of levels and factors are possible? The collection of possible sets of parameters for orthogonal arrays with N runs has a natural lattice structure ...
Rains, E. M. +2 more
core +3 more sources
Complete enumeration of two-Level orthogonal arrays of strength $d$ with $d+2$ constraints
, 2007 Enumerating nonisomorphic orthogonal arrays is an important, yet very difficult, problem. Although orthogonal arrays with a specified set of parameters have been enumerated in a number of cases, general results are extremely rare.
Stufken, John, Tang, Boxin
core +2 more sources
Equivalence of Decoupling Schemes and Orthogonal Arrays [PDF]
, 2004 We consider the problem of switching off unwanted interactions in a given multi-partite Hamiltonian. This is known to be an important primitive in quantum information processing and several schemes have been presented in the literature to achieve this ...
Roetteler, Martin, Wocjan, Pawel
core +3 more sources
Port Decoupling for Small Arrays by Means of an Eigenmode Feed Network [PDF]
, 2008 An alternative approach to port decoupling and matching of arrays with tightly coupled elements is proposed. The method is based on the inherent decoupling effect obtained by feeding the orthogonal eigenmodes of the array.
Coetzee, Jacob, Yu, Y
core +2 more sources
Solution to the Mean King's problem with mutually unbiased bases for arbitrary levels [PDF]
, 2006 The Mean King's problem with mutually unbiased bases is reconsidered for arbitrary d-level systems. Hayashi, Horibe and Hashimoto [Phys. Rev. A 71, 052331 (2005)] related the problem to the existence of a maximal set of d-1 mutually orthogonal Latin ...
A. S. Holevo +10 more
core +3 more sources