scientific article; zbMATH DE number 4064918
From MaRDI portal
Publication:3798601
Recommendations
Cited in
(19)- Super-visible codes
- On the upper bound of the size of the \(r\)-cover-free families
- A simple construction of \(d\)-disjunct matrices with certain constant weights
- Application of cover-free codes and combinatorial designs to two-stage testing.
- Bounds on the rate of disjunctive codes
- The characterization of binary constant weight codes meeting the bound of Fu and Shen
- Exact learning from an honest teacher that answers membership queries
- Linear properties of the binary superimposed code M_q(n,k, d)
- Improved algorithms for group testing with inhibitors
- scientific article; zbMATH DE number 6672604 (Why is no real title available?)
- Coding for a Multiple Access OR Channel: a Survey
- scientific article; zbMATH DE number 4162826 (Why is no real title available?)
- Uniform hypergraphs containing no grids
- New constructions of superimposed codes
- Superimposed codes and threshold group testing
- scientific article; zbMATH DE number 6796356 (Why is no real title available?)
- An upper bound for binary constant weight codes
- Families of finite sets in which no intersection of sets is covered by the union of s others
- Coding for a multiple access OR channel: A survey
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3798601)
