Maximal sets of mutually orthogonal frequency squares and Doehlert-Klee designs

Abstract

Abstract A binary frequency square of type $$(n;\lambda _0,\lambda _1)$$ ( n ; λ 0 , λ 1 ) is a (0, 1)-matrix of order n with $$\lambda _0$$ λ 0 zeros and $$\lambda _1$$ λ 1 ones in each row and in each column. Two such squares are orthogonal if there are exactly $$\lambda _1^2$$ λ 1 2 cells where both squares contain ones. A set of binary MOFS is a set of binary frequency squares in which each pair is orthogonal. A set of binary MOFS of type $$(n;\lambda _0,\lambda _1)$$ ( n ; λ 0 , λ 1 ) is type maximal if there is no square of the type $$(n;\lambda _0,\lambda _1)$$ ( n ; λ 0 , λ 1 ) that is orthogonal to every square in the set. A Doehlert-Klee design consists of points $$\mathcal {V}$$ V and blocks $$\mathcal {B}$$ B , where every pair of points occurs in precisely $$\Lambda $$ Λ blocks and every point occurs in precisely R blocks, where $$R^2=\Lambda |\mathcal {B}|$$ R 2 = Λ | B | . We show that sets of binary MOFS are equivalent to a particular kind of Doehlert-Klee design. In a distinct application, Doehlert-Klee designs can also be used to construct sets of binary MOFS that are cyclically generated from their first rows. We use these connections to find new constructions for sets of type-maximal binary MOFS.

The authors' abstract, as published at the source. Designs Codes and Cryptography, 2026 · DOI ↗