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

Are bitvectors optimal?

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing

Multiple access communications using combinatorial designs

Theoretical aspects of computer science

Multiple Access Communications Using Combinatorial Designs

Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]

Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms

Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels

Theoretical Computer Science

Cover-Free Families and Topology-Transparent Scheduling for MANETs

Designs, Codes and Cryptography

On a Bound of Cover-Free Families

Designs, Codes and Cryptography

Efficient parallel algorithms for dead sensor diagnosis and multiple access channels

Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures

Secret sharing schemes with partial broadcast channels

Designs, Codes and Cryptography

Tracing a single user

European Journal of Combinatorics - Special issue on extremal and probabilistic combinatorics

General theory of information transfer: Updated

Discrete Applied Mathematics

Coding for a multiple access OR channel: A survey

Discrete Applied Mathematics

Rateless forward error correction for topology-transparent scheduling

IEEE/ACM Transactions on Networking (TON)

Equal-Weight Fingerprinting Codes

IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology

Generalized framework for selectors with applications in optimal group testing

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Optimal monotone encodings

IEEE Transactions on Information Theory

Noise-resilient group testing: limitations and constructions

FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory

Compressed sensing with probabilistic measurements: a group testing solution

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing

A combinatorial approach to X-tolerant compaction circuits

IEEE Transactions on Information Theory

Turning privacy leaks into floods: surreptitious discovery of social network friendships and other sensitive binary attribute vectors

Proceedings of the 9th annual ACM workshop on Privacy in the electronic society

Group testing and batch verification

ICITS'09 Proceedings of the 4th international conference on Information theoretic security

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

Secure overlay network design

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management

Improved combinatorial group testing for real-world problem sizes

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures

An efficient single-key pirates tracing scheme using cover-free families

ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security

Noise-resilient group testing: Limitations and constructions

Discrete Applied Mathematics

New construction of error-tolerant pooling designs

Information Theory, Combinatorics, and Search Theory