Pages that link to "Item:Q2388455"
From MaRDI portal
The following pages link to Asymptotic upper bound for the rate of \((w,r)\) cover-free codes (Q2388455):
Displaying 15 items.
- Cover-free codes and separating system codes (Q510467) (← links)
- On the construction of \((w,r)\) cover-free codes (Q734287) (← links)
- On the upper bound of the size of the \(r\)-cover-free families (Q1328402) (← links)
- Bounds on the rate of separating codes (Q1752294) (← links)
- Some new bounds for cover-free families through biclique covers (Q1759404) (← links)
- On the optimality of trivial \((w,r)\)-cover-free codes (Q1776203) (← links)
- Some new bounds for cover-free families (Q1976329) (← links)
- Bounds on the rate of disjunctive codes (Q2262991) (← links)
- Almost cover-free codes (Q2364463) (← links)
- A note on the uniqueness of \((w, r)\) cover-free codes (Q2432945) (← links)
- Lower bounds for cover-free families (Q2629487) (← links)
- Threshold and Majority Group Testing (Q4915253) (← links)
- Superimposed Codes and Threshold Group Testing (Q4915254) (← links)
- Asymptotic bounds for the rate of colored superimposed codes (Q5121240) (← links)
- Improved upper bounds for the rate of separating and completely separating codes (Q6173461) (← links)