An upper bound on the number of frequency hypercubes

From MaRDI portal



Abstract: A frequency n-cube Fn(q;l0,...,lm−1) is an n-dimensional q-by-...-by-q array, where q=l0+...+lm−1, filled by numbers 0,...,m−1 with the property that each line contains exactly li cells with symbol i, i=0,...,m−1 (a line consists of q cells of the array differing in one coordinate). The trivial upper bound on the number of frequency n-cubes is m(q−1)n. We improve that lower bound for n>2, replacing q−1 by a smaller value, by constructing a testing set of size sn, s<q−1, for frequency n-cubes (a testing sets is a collection of cells of an array the values in which uniquely determine the array with given parameters). We also construct new testing sets for generalized frequency n-cubes, which are essentially correlation-immune functions in n q-valued arguments; the cardinalities of new testing sets are smaller than for testing sets known before. Keywords: frequency hypercube, correlation-immune function, latin hypercube, testing set.












This page was built for publication: An upper bound on the number of frequency hypercubes

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