Pages that link to "Item:Q2785370"
From MaRDI portal
The following pages link to Interval Packing and Covering in the Boolean Lattice (Q2785370):
Displaying 15 items.
- Cover-free codes and separating system codes (Q510467) (← links)
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others (Q696905) (← links)
- Uniqueness of some optimal superimposed codes (Q926629) (← links)
- An upper bound of the number of tests in pooling designs for the error-tolerant complex model (Q941032) (← links)
- On the domatic and the total domatic numbers of the 2-section graph of the order-interval hypergraph of a finite poset (Q1025567) (← links)
- The order-interval hypergraph of a finite poset and the König property (Q1363653) (← links)
- Generalized cover-free families. (Q1428544) (← links)
- Bounds on the rate of separating codes (Q1752294) (← links)
- Some new bounds for cover-free families through biclique covers (Q1759404) (← links)
- Some new bounds for cover-free families (Q1976329) (← links)
- Bounds on the rate of disjunctive codes (Q2262991) (← links)
- A note on the uniqueness of \((w, r)\) cover-free codes (Q2432945) (← links)
- An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution (Q2471071) (← links)
- On the domatic and the total domatic numbers of the 2-section graph of the order-interval hypergraph of the finite poset (Q3439342) (← links)
- Some new results on superimposed codes (Q5462393) (← links)
