New construction of error-tolerant pooling designs

Authors:
Rudolf Ahlswede;Harout Aydinian
Affiliations:
Department of Mathematics, University of Bielefeld, Bielefeld, Germany;Department of Mathematics, University of Bielefeld, Bielefeld, Germany
Venue:
Information Theory, Combinatorics, and Search Theory
Year:
2013

Citing 10
Cited 0

On the upper bound of the size of the r-cover-free families

Journal of Combinatorial Theory Series A
Optimal pooling designs with error detection

Journal of Combinatorial Theory Series A
On r-cover-free families

Journal of Combinatorial Theory Series A
A simple construction of d-disjunct matrices with certain constant weights

Discrete Mathematics
Error-correcting nonadaptive group testing with de-disjunct matrices

Discrete Applied Mathematics
New constructions of non-adaptive and error-tolerance pooling designs

Discrete Mathematics
A novel use of t-packings to construct d-disjunct matrices

Discrete Applied Mathematics
New constructions of superimposed codes

IEEE Transactions on Information Theory
Nonrandom binary superimposed codes

IEEE Transactions on Information Theory
Coding for Errors and Erasures in Random Network Coding

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a new class of error-tolerant pooling designs associated with finite vector spaces is presented. We construct dz-disjunct inclusion matrices using packings in finite projective spaces. For certain parameters our construction gives better performance than previously known ones. In particular, the construction gives a family of disjunct matrices with near optimal parameters.