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

From MaRDI portal
Publication:820504

DOI10.1134/S0037446621050165zbMATH Open1473.05037arXiv2005.10887OpenAlexW3202504086MaRDI QIDQ820504FDOQ820504


Authors: Minjia Shi, Shu-Kai Wang, Xiao-Xiao Li, Denis S. Krotov Edit this on Wikidata


Publication date: 27 September 2021

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

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


Full work available at URL: https://arxiv.org/abs/2005.10887




Recommendations




Cites Work


Uses Software





This page was built for publication: On the number of frequency hypercubes \(F^n(4;2,2) \)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820504)