Tracing a single user

DOI10.1016/j.ejc.2006.05.001zbMath1105.05068OpenAlexW1988341436MaRDI QIDQ850073

Vera Asodi, Noga Alon

Publication date: 15 November 2006

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2006.05.001

zbMATH Keywords

group testing\(r\)-single-user-tracing superimposed family\(r\)-superimposed family

Mathematics Subject Classification ID

Extremal set theory (05D05) Protein sequences, DNA sequences (92D20)

Related Items (2)

2-Cancellative Hypergraphs and Codes ⋮ Uniform hypergraphs containing no grids

Cites Work

• Unnamed Item
• Unnamed Item
• Bounds on the length of disjunctive codes
• Families of finite sets in which no set is covered by the union of \(r\) others
• New bounds for union-free families of sets
• On the upper bound of the size of the \(r\)-cover-free families
• On \(r\)-cover-free families
• Algorithmic construction of sets for k -restrictions
• Single-User Tracing and Disjointly Superimposed Codes
• A fast and simple randomized parallel algorithm for the maximal independent set problem
• Learning a Hidden Matching
• Nonrandom binary superimposed codes

This page was built for publication: Tracing a single user