Identification over multiple databases

Deniz Gündüz, Ertem Tuncel, Andrea Goldsmith, H. Vincent Poor

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations


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.

Original languageEnglish (US)
Title of host publication2009 IEEE International Symposium on Information Theory, ISIT 2009
Number of pages5
StatePublished - 2009
Event2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of
Duration: Jun 28 2009Jul 3 2009

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8102


Other2009 IEEE International Symposium on Information Theory, ISIT 2009
Country/TerritoryKorea, Republic of

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics


Dive into the research topics of 'Identification over multiple databases'. Together they form a unique fingerprint.

Cite this