Pattern matching with don't cares and few errors
Journal of Computer and System Sciences
Weighted superimposed codes and constrained integer compressed sensing
IEEE Transactions on Information Theory
On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Signature Schemes with Bounded Leakage Resilience
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficiently decodable non-adaptive group testing
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Group testing and batch verification
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
Improved constructions for non-daptive threshold group testing
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Superselectors: efficient constructions and applications
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Non-adaptive complex group testing with multiple positive sets
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Efficiently decodable error-correcting list disjunct matrices and applications
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On the Design of Deterministic Matrices for Fast Recovery of Fourier Compressible Functions
SIAM Journal on Matrix Analysis and Applications
Data forensics constructions from cryptographic hashing and coding
IWDW'11 Proceedings of the 10th international conference on Digital-Forensics and Watermarking
Homomorphic fingerprints under misalignments: sketching edit and shift distances
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Group testing with multiple mutually-obscuring positives
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.07 |
Group testing is a long studied problem in combinatorics: A small set of r ill people should be identified out of the whole (n people) by using only queries (tests) of the form "Does set X contain an ill human?". In this paper we provide an explicit construction of a testing scheme which is better (smaller) than any known explicit construction. This scheme has ${\it \Theta}\left({\min[r^2 \ln n,n]}\right)$ tests which is as many as the best non-explicit schemes have. In our construction we use a fact that may have a value by its own right: Linear error-correction codes with parameters [m,k,驴m] q meeting the Gilbert-Varshamov bound may be constructed quite efficiently, in ${\it \Theta}\left({q^km}\right)$ time.