Identification over multiple databases

Authors:
Deniz Gündüz;Ertem Tuncel;Andrea Goldsmith;H. Vincent Poor
Affiliations:
Department of Electrical Engineering, Stanford University, Stanford, CA and Department of Electrical Engineering, Princeton University, Princeton, NJ;Department of Electrical Engineering, University of California, Riverside, CA;Department of Electrical Engineering, Stanford University, Stanford, CA;Department of Electrical Engineering, Princeton University, Princeton, NJ
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Year:
2009

Citing 7
Cited 0

Information Theory: Coding Theorems for Discrete Memoryless Systems

Information Theory: Coding Theorems for Discrete Memoryless Systems
Multivariate information bottleneck

Neural Computation
Introduction to Bioinformatics: A Theoretical and Practical Approach

Introduction to Bioinformatics: A Theoretical and Practical Approach
Capacity/storage tradeoff in high-dimensional identification systems

IEEE Transactions on Information Theory
Rate-distortion approach to databases: storage and content-based retrieval

IEEE Transactions on Information Theory
Achievable Rates for Pattern Recognition

IEEE Transactions on Information Theory
Successive Refinement for Hypothesis Testing and Lossless One-Helper Problem

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The tradeoff between storage and identification rates for multiple databases is investigated from an information theoretic perspective. In the assumed model, noisy observations of feature vectors of two distinct groups, called the ancestors, are compressed and stored in two separate databases. When queried with a noisy observation of a (possibly random) function of two randomly selected ancestors (one from each group), the system is required to correctly identify the ancestors with high probability. Single-letter inner and outer bounds are presented on the set of achievable rate points, which identify a tradeoff between the compression rates and the identification rate region: the lower the compression rates for storage, the larger the rate region achievable for identification.