An efficient algorithm for the identification of isomorphic orthogonal arrays

DOI10.1080/09720529.2006.10698066MaRDI QIDQ5473099zbMATH OpenOpenAlexFDO

Authors Haralambos Evangelaras, E. Lappas, 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)

Recommendations

• An effective step-down algorithm for the construction and the identification of nonisomorphic orthogonal arrays
• Further contributions to nonisomorphic two level orthogonal arrays
• On the isomorphism of fractional factorial designs
• Some new orthogonal arrays \(\mathrm{OA}(4r,r^{1}2^{p},2)\)
• Projection properties of certain three level orthogonal arrays

Cites work

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

Cited in

(5)

• Construction and nonparametric testing of orthogonal arrays through algebraic strata and inequivalent permutation matrices
• Complete enumeration of pure-level and mixed-level orthogonal arrays
• Degree of isomorphism: a novel criterion for identifying and classifying orthogonal designs
• New non-isomorphic detection methods for orthogonal designs
• An effective step-down algorithm for the construction and the identification of nonisomorphic orthogonal arrays

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5473099)