Derives improved probabilistic lower bounds on rates of d-SM, bar d-SM, (d, n^{1/d})-LDSM and (bar d, n^{1/d})-LDSM for d >= 3.
Effici ent algorithms for noisy group testing,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Improved Probabilistic Lower Bounds for Separable Matrices
Derives improved probabilistic lower bounds on rates of d-SM, bar d-SM, (d, n^{1/d})-LDSM and (bar d, n^{1/d})-LDSM for d >= 3.