Embedding cyclic Latin squares of order \(2^ n\) in a complete set of orthogonal F-squares

DOI10.1016/0378-3758(84)90073-9zbMath0561.62070OpenAlexW2076647086MaRDI QIDQ2266556

John P. Mandeli, Steven J. Schwager, Walter T. Federer

Publication date: 1984

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0378-3758(84)90073-9

zbMATH Keywords

Hadamard productHadamard matrixTablesorthogonal F-squarescomplete set of F-squarescyclic Latin square

Mathematics Subject Classification ID

Design of statistical experiments (62K99) Factorial statistical designs (62K15)

Related Items (5)

Polynomial representation of complete sets of mutually orthogonal frequency squares of prime power order ⋮ Orthogonal F-rectangles, orthogonal arrays, and codes ⋮ On difference matrices, transversal designs, resolvable transversal designs and large sets of mutually orthogonal F-squares ⋮ Embedding cyclic Latin squares of order \(2^ n\) in a complete set of orthogonal F-squares ⋮ Pairwise orthogonal F-rectangle designs

Cites Work

• Unnamed Item
• Further contributions to the theory of F-squares design
• On inverting circulant matrices
• Embedding cyclic Latin squares of order \(2^ n\) in a complete set of orthogonal F-squares
• Nonisomorphic complete sets of orthogonal f-squares and hadamard matrices
• $F$-Square and Orthogonal $F$-Squares Design: A Generalization of Latin Square and Orthogonal Latin Squares Design
• Hadamard matrices and their applications

This page was built for publication: Embedding cyclic Latin squares of order \(2^ n\) in a complete set of orthogonal F-squares