Asymptotic Upper Bound for the Rate of (w, r) Cover-Free Codes
Problems of Information Transmission
On the Optimality of Trivial (w, r)-Cover-Free Codes
Problems of Information Transmission
Nonadaptive algorithms for threshold group testing
Discrete Applied Mathematics
IEEE Transactions on Information Theory - Special issue on information theory in molecular biology and neuroscience
Separating codes and a new combinatorial search model
Problems of Information Transmission
Improved constructions for non-daptive threshold group testing
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
General Theory of Information Transfer and Combinatorics
New constructions of superimposed codes
IEEE Transactions on Information Theory
Nonrandom binary superimposed codes
IEEE Transactions on Information Theory
Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes
IEEE Transactions on Information Theory
Hi-index | 0.00 |
We will discuss superimposed codes and non-adaptive group testing designs arising from the potentialities of compressed genotyping models in molecular biology. The given paper was motivated by the 30th anniversary of D'yachkov-Rykov recurrent upper bound on the rate of superimposed codes published in 1982. We were also inspired by recent results obtained for non-adaptive threshold group testing which develop the theory of superimposed codes.