Binary representations of underdetermined data and superimposed codes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4043100 (Why is no real title available?)
- scientific article; zbMATH DE number 3510185 (Why is no real title available?)
- scientific article; zbMATH DE number 3801449 (Why is no real title available?)
- scientific article; zbMATH DE number 1418320 (Why is no real title available?)
- An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
- Bounds for key distribution patterns
- Elements of underdetermined information theory
- Explicit Non-adaptive Combinatorial Group Testing Schemes
- Families of finite sets in which no set is covered by the union of \(r\) others
- Key storage in secure networks
- New constructions of superimposed codes
- Nonrandom binary superimposed codes
- On r-cover-free families
- On key storage in secure networks
- On the upper bound of the size of the \(r\)-cover-free families
- On the upper bounds of the minimum number of rows of disjunct matrices
Cited in
(4)
This page was built for publication: Binary representations of underdetermined data and superimposed codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5150557)