A construction method for complete sets of mutually orthogonal frequency squares
An \(n\times n\) matrix \(M\) over an \(m\)-set \(S\), \(n=\lambda m\), is called a frequency square of type \(F(n;\lambda)\) if every element of \(S\) occurs exactly \(\lambda\) times in each row and each column of \(M\), and two such matrices are called orthogonal if when one is superimposed on the other each element of \(S\times S\) appears \(\lambda^2\) times. A set of \({(n- 1)^2\over (m-1)}\) mutually orthogonal frequency squares (MOFS) of type \(F(n;\lambda)\) is called a complete set of type \(F(n;\lambda)\). Assuming the existence of affine designs with certain parameters and MOFS of suitable types the author generates MOFS of different types.
- Polynomial representation of complete sets of mutually orthogonal frequency squares of prime power order
- Construction of complete sets of mutually equiorthogonal frequency hypercubes
- Frequency squares and affine designs
- Maximal sets of mutually orthogonal frequency squares
- Some new results on mutually orthogonal frequency squares
- scientific article; zbMATH DE number 4122006 (Why is no real title available?)
- A new representation of mutually orthogonal frequency squares
- scientific article; zbMATH DE number 2187682 (Why is no real title available?)
- The geometry of frequency squares
- Mutually orthogonal frequency rectangles
- Mutually orthogonal binary frequency squares
This page was built for publication: A construction method for complete sets of mutually orthogonal frequency squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1578482)