An efficient algorithm for the identification of isomorphic orthogonal arrays

Journal of Discrete Mathematical Sciences and Cryptography

Volumn 9, Issue 1, 2006, Pages 125-132

  Evangelaras, H ^a   Koukouvinos, C ^a   Lappas, E ^a  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

Complexity; Efficiency; Isomorhism; Orthogonal arrays

Indexed keywords

EID: 34547355406     PISSN: 09720529     EISSN: None     Source Type: Journal    
DOI: 10.1080/09720529.2006.10698066     Document Type: Article

References (4)

1. Clark, J. B., and Dean, A. M., 2001. Equivalence of fractional factorial designs. Statistica Sinica, 11:537–547.
2. Fang, K.-T., and Ge, G., 2004. A sensitive algorithm for detecting the inequivalence of Hadamard matrices. Mathematics of Computation, 73:843–851.
3. Hedayat, A. S., Sloane, N. J. A., and Stufken, J., 1999. Orthogonal Arrays:Theory and Applications, New York:Springer-Verlag.
4. Ma, C.-X., Fang, K.-T., and Lin, D. K. J., 2001. On the isomorphism of fractional factorial designs. Journal of Complexity, 17:86–97.