Author:
Cantor David G.,Mills W. H.
Abstract
Let N be a finite set of n elements. A collection ﹛S1, S2, … , Sm﹜ of subsets of N is called a determining collection if an arbitrary subset T of N is uniquely determined by the cardinalities of the intersections Si ⋂ T, 1 ≤ i ≤ m. The purpose of this paper is to study the minimum value D(n) of m for which a determining collection of m subsets exists.This problem can be expressed as a coin-weighing problem (1; 7).In a recent paper Cantor (1) showed that D(n) = O(n/log log n), thus proving a conjecture of N. J. Fine (3) that D(n) = o(n). More recently Erdös and Rényi (2), Söderberg and Shapiro (7), Berlekamp, Mills, and Leo Moser have independently found proofs that D(n) = O(n/log n).
Publisher
Canadian Mathematical Society
Cited by
50 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Mastermind with a linear number of queries;Combinatorics, Probability and Computing;2023-11-08
2. Recovery From Non-Decomposable Distance Oracles;IEEE Transactions on Information Theory;2023-10
3. Non-adaptive Quantitative Group Testing via Plotkin-Type Constructions;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25
4. Random and quasi-random designs in group testing;Journal of Statistical Planning and Inference;2022-12
5. Signature Codes for a Noisy Adder Multiple Access Channel;2022 IEEE Information Theory Workshop (ITW);2022-11-01