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.
Lectures on Designing Screening Experiments
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Designing Screening Experiments (DSE) is a class of information - theoretical models for multiple - access channels (MAC). We discuss the combinatorial model of DSE called a disjunct channel model. This model is the most important for applications and closely connected with the superimposed code concept. We give a detailed survey of lower and upper bounds on the rate of superimposed codes. The best known constructions of superimposed codes are considered in paper. We also discuss the development of these codes (non-adaptive pooling designs) intended for the clone - library screening problem. We obtain lower and upper bounds on the rate of binary codes for the combinatorial model of DSE called an adder channel model. We also consider the concept of universal decoding for the probabilistic DSE model called a symmetric model of DSE.
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.