An effective step-down algorithm for the construction and the identification of nonisomorphic orthogonal arrays

DOI10.1007/s00184-006-0101-8zbMath1433.62227OpenAlexW2024862092MaRDI QIDQ745403

P. Angelopoulos, E. Lappas, Christos Koukouvinos, Haralambos Evangelaras

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

zbMATH Keywords

isomorphismorthogonal arraysconstruction algorithm

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Hermitian, skew-Hermitian, and related matrices (15B57) Factorial statistical designs (62K15)

Related Items

Coarse-grained entanglement classification through orthogonal arrays ⋮ Optimal design generation: an approach based on discovery probability ⋮ Nonexistence of (9, 112, 4) and (10, 224, 5) binary orthogonal arrays ⋮ Encryption schemes using orthogonal arrays ⋮ Nonexistence of a few binary orthogonal arrays ⋮ Classification of orthogonal arrays by integer programming ⋮ Complete enumeration of pure-level and mixed-level orthogonal arrays ⋮ A Bird’s-Eye View of Modern Symmetric Cryptography from Combinatorial Designs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complete enumeration of two-level orthogonal arrays of strength \(d\) with \(d+2\) constraints
• Orthogonal arrays. Theory and applications
• Generalized minimum aberration for asymmetrical fractional factorial designs.
• 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
• Classification of orthogonal arrays by integer programming
• A Combinatorial Problem
• An efficient algorithm for the identification of isomorphic orthogonal arrays
• A note on generalized aberration in factorial designs