Pages that link to "Item:Q1166519"

The following pages link to Families of finite sets in which no set is covered by the union of two others (Q1166519):

Displaying 43 items.

• Almost disjunctive list-decoding codes (Q259899) (← links)
• Improved algorithms for group testing with inhibitors (Q293316) (← links)
• Uniform hypergraphs containing no grids (Q390731) (← links)
• Almost cover-free codes and designs (Q510471) (← 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)
• Constructions and bounds for \((m,t)\)-splitting systems (Q861791) (← links)
• Applications of coding theory to communication combinatorial problems (Q916665) (← links)
• Families of finite sets in which no set is covered by the union of \(r\) others (Q1072559) (← links)
• Explicit construction of exponential sized families of k-independent sets (Q1073031) (← links)
• Sets pooling designs (Q1306748) (← links)
• On the upper bound of the size of the \(r\)-cover-free families (Q1328402) (← links)
• A simple construction of \(d\)-disjunct matrices with certain constant weights (Q1356684) (← links)
• Generalized cover-free families. (Q1428544) (← links)
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures (Q1569877) (← links)
• Some new bounds for cover-free families through biclique covers (Q1759404) (← links)
• Matchings and covers in hypergraphs (Q1813100) (← links)
• Coding for write-unidirectional memories and conflict resolution (Q1823916) (← links)
• Multireceiver authentication codes: Models, bounds, constructions, and extensions (Q1854288) (← links)
• On the extremal combinatorics of the Hamming space (Q1894014) (← links)
• On key storage in secure networks (Q1903344) (← links)
• Some new bounds for cover-free families (Q1976329) (← links)
• On 2-parent-identifying set systems of block size 4 (Q2004967) (← links)
• Union-intersection-bounded families and their applications (Q2026353) (← links)
• Separable collusion-secure multimedia codes (Q2044131) (← links)
• Generalization of IPP codes and IPP set systems (Q2190902) (← links)
• Traceability codes and their generalizations (Q2190905) (← links)
• Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise (Q2229581) (← links)
• Strict group testing and the set basis problem (Q2452424) (← links)
• A classification of the structures of some Sperner families and superimposed codes (Q2502898) (← links)
• Strongly separable matrices for nonadaptive combinatorial group testing (Q2659071) (← links)
• Tropical Complexity, Sidon Sets, and Dynamic Programming (Q2832574) (← links)
• 2-Cancellative Hypergraphs and Codes (Q2883859) (← links)
• Two-Dimensional Representation of Cover Free Families and Its Applications: Short Signatures and More (Q2890012) (← links)
• Exhaustive testing of almost all devices with outputs depending on limited number of inputs (Q4391010) (← links)
• (Q4487082) (← links)
• Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk) (Q5502804) (← links)
• Delta-systems and qualitative (in)dependence (Q5917474) (← links)
• Recursive bounds for perfect hashing (Q5939232) (← links)
• Broadcast authentication for group communication (Q5958610) (← links)
• Avoiding right angles and certain Hamming distances (Q6051134) (← links)
• Near-sunflowers and focal families (Q6076184) (← links)
• Improved upper bounds for the rate of separating and completely separating codes (Q6173461) (← links)