On the construction of orthogonal F-squares of order n from an orthogonal array (n,k,s,2) and an OL(s,t) set
From MaRDI portal
Publication:1168027
DOI10.1016/0378-3758(81)90006-9zbMath0492.62069OpenAlexW2094479173MaRDI QIDQ1168027
Walter T. Federer, F.-C. Helen Lee, John P. Mandeli
Publication date: 1981
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/32799
mutually orthogonal Latin squaresorthogonal arraycomplete setsbest upper boundmaximal numberasymptotically completeconstruction of orthogonal F-squaresvarying number of symbols
Related Items
Polynomial representation of complete sets of mutually orthogonal frequency squares of prime power order, Orthogonal F-rectangles, orthogonal arrays, and codes, Construction of asymmetrical orthogonal arrays having factors with a large non-prime power number of levels, On difference matrices, transversal designs, resolvable transversal designs and large sets of mutually orthogonal F-squares, Properties of complete sets of mutually equiorthogonal frequency hypercubes, Construction of complete sets of mutually equiorthogonal frequency hypercubes, Pairwise orthogonal F-rectangle designs, Lattice square approach to construction of mutually orthogonal F-squares
Cites Work
- Unnamed Item
- Further contributions to the theory of F-squares design
- On the existence and construction of a complete set of orthogonal F(4t; 2t, 2t)-squares design
- Some Main-Effect Plans and Orthogonal Arrays of Strength Two
- $F$-Square and Orthogonal $F$-Squares Design: A Generalization of Latin Square and Orthogonal Latin Squares Design