On the number of frequency hypercubes $F^n(4;2,2)$

Minjia Shi, Shukai Wang, Xiaoxiao Li, Denis S. Krotov

Published 2020-05-21Version 1

A frequency $n$-cube $F^n(4;2,2)$ is an $n$-dimensional $4\times\cdots\times 4$ array filled by $0$s and $1$s such that each line contains exactly two $1$s. We classify the frequency $4$-cubes $F^4(4;2,2)$, find a testing set of size $25$ for $F^3(4;2,2)$, and derive an upper bound on the number of $F^n(4;2,2)$. Additionally, for any $n$ greater than $2$, we construct an $F^n(4;2,2)$ that cannot be refined to a latin hypercube, while each of its sub-$F^{n-1}(4;2,2)$ can. Keywords: frequency hypercube, frequency square, latin hypercube, testing set, MDS code