An efficient algorithm for the identification of isomorphic orthogonal arrays

DOI10.1080/09720529.2006.10698066zbMath1094.05007OpenAlexW2318907015MaRDI QIDQ5473099

E. Lappas, Haralambos Evangelaras, Christos Koukouvinos

Publication date: 19 June 2006

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2006.10698066

zbMATH Keywords

designsefficient algorithm

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Factorial statistical designs (62K15)

Related Items (5)

Construction and Nonparametric Testing of Orthogonal Arrays through Algebraic Strata and Inequivalent Permutation Matrices ⋮ Degree of isomorphism: a novel criterion for identifying and classifying orthogonal designs ⋮ New non-isomorphic detection methods for orthogonal designs ⋮ Complete enumeration of pure-level and mixed-level orthogonal arrays ⋮ An effective step-down algorithm for the construction and the identification of nonisomorphic orthogonal arrays

Cites Work

• Orthogonal arrays. Theory and applications
• A sensitive algorithm for detecting the inequivalence of Hadamard matrices
• On the isomorphism of fractional factorial designs

This page was built for publication: An efficient algorithm for the identification of isomorphic orthogonal arrays