Pages that link to "Item:Q1024738"
From MaRDI portal
The following pages link to On the upper bounds of the minimum number of rows of disjunct matrices (Q1024738):
Displaying 12 items.
- A generalization of Macula's disjunct matrices (Q411221) (← links)
- Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices (Q875600) (← links)
- A simple construction of \(d\)-disjunct matrices with certain constant weights (Q1356684) (← links)
- \(d\)-disjunct matrices: Bounds and Lovász local lemma (Q1613522) (← links)
- On the essential test sets of discrete matrices (Q1894367) (← links)
- Low-weight superimposed codes and related combinatorial structures: bounds and applications (Q2285161) (← links)
- A novel use of \(t\)-packings to construct \(d\)-disjunct matrices (Q2499596) (← links)
- Combinatorial problems originated in group testing, coding theory, and complexity theory (Q2736188) (← links)
- (Q5150557) (← links)
- On two problems of information theory (Q5731202) (← links)
- Bounds and algorithms for generalized superimposed codes (Q6161430) (← links)
- An efficient algorithm for group testing with runlength constraints (Q6648259) (← links)