The common randomness capacity of a pair of independent discrete memoryless channels

DOI10.1109/18.651022MaRDI QIDQ4392447zbMATH OpenOpenAlexFDO

Authors Sivarama Venkatesan, Venkat Anantharam

Publication date 8 June 1998

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.651022

zbMATH Keywords

common randomnessgenerating randomness from noiseindependent discrete memoryless channels

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• The common randomness capacity of a network of discrete memoryless channels
• Common randomness in information theory and cryptography. II. CR capacity
• Common Randomness and Secret Key Capacities of Two-Way Channels
• Common randomness and secret key generation with a helper

Cited in

(4)

• Common randomness and distributed control: A counterexample
• Common Randomness and Secret Key Capacities of Two-Way Channels
• Common randomness in information theory and cryptography. II. CR capacity
• The common randomness capacity of a network of discrete memoryless channels

This page was built for publication: The common randomness capacity of a pair of independent discrete memoryless channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4392447)