An upper bound on the number of frequency hypercubes
From MaRDI portal
Abstract: A frequency -cube is an -dimensional -by-...-by- array, where , filled by numbers with the property that each line contains exactly cells with symbol , (a line consists of cells of the array differing in one coordinate). The trivial upper bound on the number of frequency -cubes is . We improve that lower bound for , replacing by a smaller value, by constructing a testing set of size , , for frequency -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 -cubes, which are essentially correlation-immune functions in -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.
Recommendations
Cites work
- 10.17686/sced_rusnauka_2008-1040
- An upper bound on the number of high-dimensional permutations
- Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
- scientific article; zbMATH DE number 5504491 (Why is no real title available?)
- scientific article; zbMATH DE number 176542 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 850320 (Why is no real title available?)
- On the number of SQSs, Latin hypercubes and MDS codes
- On the vertices of the d-dimensional Birkhoff polytope
- Orthogonal arrays. Theory and applications
- Permanents of multidimensional matrices: properties and applications
- Sets of orthogonal hypercubes of class \(r\)
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)