Key capacity for product sources with application to stationary Gaussian processes

Jingbo Liu, Paul Cuff, Sergio Verdú

Research output: Contribution to journalArticlepeer-review

14 Scopus citations


We show that for product sources, rate splitting is optimal for secret key agreement using limited one-way communication between two terminals. This yields an alternative proof of the tensorization property of a strong data processing inequality originally studied by Erkip and Cover and amended recently by Anantharam et al. We derive a water-filling solution of the communication-rate-key-rate tradeoff for a wide class of discrete memoryless vector Gaussian sources which subsumes the case without an eavesdropper. Moreover, we derive an explicit formula for the maximum secret key per bit of communication for all discrete memoryless vector Gaussian sources using a tensorization property and a variation on the enhanced channel technique of Weingarten et al. Finally, a one-shot information spectrum achievability bound for key generation is proved from which we characterize the communication-rate-key-rate tradeoff for stationary Gaussian processes.

Original languageEnglish (US)
Article number2507602
Pages (from-to)984-1005
Number of pages22
JournalIEEE Transactions on Information Theory
Issue number2
StatePublished - Feb 1 2016

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


  • Correlation coefficient
  • Decorrelation
  • Fourier transforms
  • Gaussian processes
  • MIMO
  • Random number generation
  • Source coding


Dive into the research topics of 'Key capacity for product sources with application to stationary Gaussian processes'. Together they form a unique fingerprint.

Cite this