Tracing a single user

DOI10.1016/J.EJC.2006.05.001MaRDI QIDQ850073zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Tracing Many Users With Almost No Rate Penalty
• scientific article; zbMATH DE number 910893
• Strict group testing and the set basis problem
• On the structure of a class of sets useful in nonadaptive group testing
• Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes

Cites work

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

Cited in

(3)

• 2-cancellative hypergraphs and codes
• Uniform hypergraphs containing no grids
• Tracing Many Users With Almost No Rate Penalty

This page was built for publication: Tracing a single user

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q850073)