pith. sign in

arxiv: 1401.7505 · v1 · pith:MSUNQ3O2new · submitted 2014-01-29 · 💻 cs.IT · math.IT

Lectures on Designing Screening Experiments

classification 💻 cs.IT math.IT
keywords modelcodescalledscreeningsuperimposedboundschannelcombinatorial
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Improved Probabilistic Lower Bounds for Separable Matrices

    cs.IT 2024-01 unverdicted novelty 5.0

    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.