scientific article; zbMATH DE number 7310189

zbMath1468.94367MaRDI QIDQ5150557

L. A. Sholomov

Publication date: 15 February 2021

Full work available at URL: http://mathnet.ru/eng/pdm400

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

compressionpolynomial algorithmdisjunct matrixunderdetermined datasuperimposed codecover-free familybinary representationrepresentation lengthsets system basis

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Source coding (94A29)

Related Items (2)

List decoding for a multiple access hyperchannel ⋮ Symmetric disjunctive list-decoding codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the upper bounds of the minimum number of rows of disjunct matrices
• Families of finite sets in which no set is covered by the union of \(r\) others
• Key storage in secure networks
• On the upper bound of the size of the \(r\)-cover-free families
• Bounds for key distribution patterns
• On key storage in secure networks
• On \(r\)-cover-free families
• Explicit Non-adaptive Combinatorial Group Testing Schemes
• New constructions of superimposed codes
• An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
• Nonrandom binary superimposed codes

This page was built for publication: