Место издания:Lecture Note Series 10 , Feb. 2003 , Combinatorial and Computational Mathematics Center Pohang University of Science and Technology (POSTECH) Pohang, Korea Republic
Объём:
111 страниц
Аннотация:Designing Screening Experiments (DSE)
is a class of information - theoretical models for multiple
- access channels (MAC). In Sect.2-4, 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.
In Sect.2, 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
Sect.3-4, where we also discuss the development of these
codes (non-adaptive pooling designs) intended for the clone
- library screening problem. In Sect.5, we obtain lower
and upper bounds on the rate of binary codes for the
combinatorial model of DSE called an adder channel model.
In Sect.6, we consider the concept of universal decoding
for the probabilistic DSE model called a symmetric model
of DSE.