Mutually orthogonal binary frequency squares

Thomas Britz, Nicholas J. Cavenagh, Adam Mammoliti, Ian M. Wanless

Research output: Contribution to journalArticleResearchpeer-review

1 Citation (Scopus)

Abstract

A frequency square is a matrix in which each row and column is a permutation of the same multiset of symbols. We consider only binary frequency squares of order n with n/2 zeros and n/2 ones in each row and column. Two such frequency squares are orthogonal if, when superimposed, each of the 4 possible ordered pairs of entries occurs equally often. In this context we say that a set of k-MOFS(n) is a set of k binary frequency squares of order n in which each pair of squares is orthogonal.

Original languageEnglish
Article numberP3.7
Pages (from-to)1-26
Number of pages26
JournalThe Electronic Journal of Combinatorics
Volume27
Issue number3
DOIs
Publication statusPublished - 10 Jul 2020

Cite this