The following pages link to On \(r\)-cover-free families (Q1906129):
Displaying 39 items.
- 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)
- Tracing a single user (Q850073) (← 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)
- Distributed broadcast in radio networks of unknown topology. (Q1401336) (← 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)
- Some new bounds for cover-free families through biclique covers (Q1759404) (← links)
- Some new bounds for cover-free families (Q1976329) (← links)
- Structure-aware combinatorial group testing: a new method for pandemic screening (Q2169949) (← links)
- Modification tolerant signature schemes: location and correction (Q2179378) (← links)
- Nested cover-free families for unbounded fault-tolerant aggregate signatures (Q2220866) (← links)
- Low-weight superimposed codes and related combinatorial structures: bounds and applications (Q2285161) (← links)
- Sampling schemes and recovery algorithms for functions of few coordinate variables (Q2307488) (← links)
- Deterministic M2M multicast in radio networks (Q2508975) (← 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)
- Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011) (← links)
- Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications (Q3012832) (← 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)
- (Q4487082) (← links)
- New Construction of Error-Tolerant Pooling Designs (Q4915255) (← links)
- Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs (Q5090407) (← links)
- Spanoids---An Abstraction of Spanning Structures, and a Barrier for LCCs (Q5112250) (← links)
- (Q5150557) (← links)
- Mutual Inhibition with Few Inhibitory Cells via Nonlinear Inhibitory Synaptic Interaction (Q5214398) (← links)
- Almost Optimal Cover-Free Families (Q5283363) (← links)
- On Cancellative Set Families (Q5443805) (← links)
- A new kind of selectors and their applications to conflict resolution in wireless multichannels networks (Q5919324) (← links)
- Bounds and algorithms for generalized superimposed codes (Q6161430) (← links)
- On detecting some defective items in group testing (Q6591475) (← links)
- A survey of cover-free families: constructions, applications, and generalizations (Q6613366) (← links)