Asymptotics of Fingerprinting and Group Testing: Tight Bounds From Channel Capacities
نویسندگان
چکیده
منابع مشابه
Asymptotics of Fingerprinting and Group Testing
This extended abstract provides an overview of the results presented in [8, 9] regarding the large-coalition asymptotics of collusion-resistant fingerprinting and the asymptotics of group testing for large numbers of defectives.
متن کاملAsymptotics of fingerprinting and group testing: capacity-achieving log-likelihood decoders
We study the large-coalition asymptotics of fingerprinting and group testing, and derive explicit decoders that provably achieve capacity for many of the considered models. We do this both for simple decoders (fast but suboptimal) and for joint decoders (slow but optimal), and both for informed and uninformed settings. For fingerprinting, we show that if the pirate strategy is known, the Neyman...
متن کاملTight Lower Bounds for Testing Linear Isomorphism
We study lower bounds for testing membership in families of linear/affine-invariant Boolean functions over the hypercube. A family of functions P ⊆ {{0, 1} → {0, 1}} is linear/affine invariant if for any f ∈ P , it is the case that f ◦L ∈ P for any linear/affine transformation L of the domain. Motivated by the recent resurgence of attention to the permutation isomorphism problem, we first focus...
متن کاملNoisy Adaptive Group Testing: Bounds and Algorithms
The group testing problem consists of determining a small set of defective items from a larger set of items based on a number of possibly-noisy tests, and is relevant in applications such as medical testing, communication protocols, pattern matching, and many more. One of the defining features of the group testing problem is the distinction between the non-adaptive and adaptive settings: In the...
متن کاملTight Bounds for the Distribution-Free Testing of Monotone Conjunctions
We improve both upper and lower bounds for the distribution-free testing of monotone conjunctions. Given oracle access to an unknown Boolean function f : {0, 1}n →{0, 1} and sampling oracle access to an unknown distribution D over {0, 1}n, we present an Õ(n/ǫ)-query algorithm that tests whether f is a monotone conjunction versus ǫ-far from any monotone conjunction with respect to D. This improv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Forensics and Security
سال: 2015
ISSN: 1556-6013,1556-6021
DOI: 10.1109/tifs.2015.2440190