scientific article

zbMath0639.62076MaRDI QIDQ3780312

Vera T. Sós, Frank K. Hwang

Publication date: 1987

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

zbMATH Keywords

non-adaptived-complete designextremal problem for set-systemshypergeometric group testingminimal number of tests

Mathematics Subject Classification ID

Design of statistical experiments (62K99) Applications of statistics in engineering and industry; control charts (62P30) Permutations, words, matrices (05A05)

Related Items (31)

On the upper bound of the size of the \(r\)-cover-free families ⋮ On the structure of a class of sets useful in nonadaptive group testing ⋮ On the extremal combinatorics of the Hamming space ⋮ Tracing a single user ⋮ A simple construction of \(d\)-disjunct matrices with certain constant weights ⋮ Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing ⋮ Finding defective coins ⋮ Weakly union-free twofold triple systems ⋮ Uniform hypergraphs containing no grids ⋮ Distributed broadcast in radio networks of unknown topology. ⋮ Smart elements in combinatorial group testing problems with more defectives ⋮ Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. ⋮ Generalized cover-free families. ⋮ Some Completeness Results on Decision Trees and Group Testing ⋮ Some new bounds for cover-free families ⋮ Coding for a multiple access OR channel: A survey ⋮ New Construction of Error-Tolerant Pooling Designs ⋮ Union-intersection-bounded families and their applications ⋮ Low-weight superimposed codes and related combinatorial structures: bounds and applications ⋮ Local conflict coloring revisited: Linial for lists ⋮ Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix ⋮ A survey of cover-free families: constructions, applications, and generalizations ⋮ Optimal Dorfman group testing for symmetric distributions ⋮ Application of cover-free codes and combinatorial designs to two-stage testing. ⋮ On the upper bounds of the minimum number of rows of disjunct matrices ⋮ Secure frameproof codes, key distribution patterns, group testing algorithms and related structures ⋮ Unnamed Item ⋮ Improved bounds for group testing designs ⋮ Linial for lists ⋮ Faster broadcasting in unknown radio networks ⋮ Families of finite sets in which no set is covered by the union of \(r\) others

This page was built for publication: