An effective step-down algorithm for the construction and the identification of nonisomorphic orthogonal arrays
DOI10.1007/S00184-006-0101-8zbMATH Open1433.62227OpenAlexW2024862092MaRDI QIDQ745403FDOQ745403
Authors: P. Angelopoulos, E. Lappas, Haralambos Evangelaras, Christos Koukouvinos 
Publication date: 14 October 2015
Published in: Metrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00184-006-0101-8
Recommendations
- An efficient algorithm for the identification of isomorphic orthogonal arrays
- An algorithmic approach to constructing mixed-level orthogonal and near-orthogonal arrays
- Algorithm for the construction and classification of orthogonal arrays and its feasibility
- A new approach in constructing orthogonal and nearly orthogonal arrays.
- Construction of a new class of orthogonal arrays
- A new and flexible design construction for orthogonal arrays for modern applications
- Further contributions to nonisomorphic two level orthogonal arrays
- On the construction of asymmetric orthogonal arrays
Factorial statistical designs (62K15) Hermitian, skew-Hermitian, and related matrices (15B57) Orthogonal arrays, Latin squares, Room squares (05B15)
Cites Work
- Orthogonal arrays. Theory and applications
- Title not available (Why is that?)
- Generalized minimum aberration for asymmetrical fractional factorial designs.
- A Combinatorial Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on generalized aberration in factorial designs
- Complete enumeration of two-level orthogonal arrays of strength \(d\) with \(d+2\) constraints
- Classification of orthogonal arrays by integer programming
- Design catalog based on minimum \(G\)-aberration
- Evaluation of inequivalent projections of Hadamard matrices of order 24
- Further contributions to nonisomorphic two level orthogonal arrays
- A remark on the two level orthogonal array of order 12
- Title not available (Why is that?)
- An efficient algorithm for the identification of isomorphic orthogonal arrays
Cited In (9)
- Nonexistence of (9, 112, 4) and (10, 224, 5) binary orthogonal arrays
- A Bird’s-Eye View of Modern Symmetric Cryptography from Combinatorial Designs
- Classification of orthogonal arrays by integer programming
- An efficient algorithm for the identification of isomorphic orthogonal arrays
- Optimal design generation: an approach based on discovery probability
- Encryption schemes using orthogonal arrays
- Complete enumeration of pure-level and mixed-level orthogonal arrays
- Coarse-grained entanglement classification through orthogonal arrays
- Nonexistence of a few binary orthogonal arrays
This page was built for publication: An effective step-down algorithm for the construction and the identification of nonisomorphic orthogonal arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q745403)
