Pages that link to "Item:Q1328402"

The following pages link to On the upper bound of the size of the \(r\)-cover-free families (Q1328402):

Displaying 38 items.

• Improved algorithms for group testing with inhibitors (Q293316) (← links)
• Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing (Q346522) (← links)
• Improved constructions for non-adaptive threshold group testing (Q378256) (← links)
• Two new perspectives on multi-stage group testing (Q378258) (← links)
• Uniform hypergraphs containing no grids (Q390731) (← links)
• Almost separable matrices (Q512882) (← links)
• Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others (Q696905) (← links)
• A probabilistic variant of Sperner's theorem and of maximal \(r\)-cover free families (Q785827) (← links)
• Secure overlay network design (Q848639) (← links)
• Tracing a single user (Q850073) (← links)
• Secret sharing schemes with partial broadcast channels (Q851779) (← links)
• Codes identifying sets of vertices in random networks (Q870971) (← links)
• On the complexity of neighbourhood learning in radio networks (Q896133) (← links)
• General theory of information transfer: Updated (Q947076) (← links)
• Coding for a multiple access OR channel: A survey (Q947083) (← links)
• On the upper bounds of the minimum number of rows of disjunct matrices (Q1024738) (← links)
• Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. (Q1426451) (← links)
• Generalized cover-free families. (Q1428544) (← links)
• Constructions for key distribution patterns (Q1692698) (← links)
• Some intriguing upper bounds for separating hash families (Q1729948) (← links)
• Some new bounds for cover-free families through biclique covers (Q1759404) (← links)
• On the extremal combinatorics of the Hamming space (Q1894014) (← links)
• Some new bounds for cover-free families (Q1976329) (← links)
• Structure-aware combinatorial group testing: a new method for pandemic screening (Q2169949) (← links)
• Low-weight superimposed codes and related combinatorial structures: bounds and applications (Q2285161) (← links)
• Locating and detecting arrays for interaction faults (Q2426663) (← links)
• Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis (Q2426667) (← links)
• Transport schemes for topology-transparent scheduling (Q2471060) (← links)
• Lower bounds for cover-free families (Q2629487) (← links)
• Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
• 2-Cancellative Hypergraphs and Codes (Q2883859) (← links)
• Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications (Q3012832) (← links)
• COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY (Q3063600) (← links)
• Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing (Q3297759) (← links)
• Coding for a Multiple Access OR Channel: a Survey (Q3439269) (← links)
• Smart elements in combinatorial group testing problems with more defectives (Q5121559) (← links)
• (Q5875503) (← links)
• Bounds and algorithms for generalized superimposed codes (Q6161430) (← links)