Common randomness in information theory and cryptography. II. CR capacity

DOI10.1109/18.651026zbMath0910.94010OpenAlexW2153396718MaRDI QIDQ4392448

Imre Csiszár, Rudolf Ahlswede

Publication date: 20 April 1999

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

Full work available at URL: https://semanticscholar.org/paper/ac22db786df8137547214bd27e6ce115b74f815e

zbMATH Keywords

arbitrarily varying channelscommon randomness

Mathematics Subject Classification ID

Information theory (general) (94A15) Channel models (including quantum) in information and communication theory (94A40)

Related Items

Common randomness and distributed control: A counterexample ⋮ Aspects of generic entanglement ⋮ Public and private resource trade-offs for a quantum channel ⋮ One-message secure reductions: on the cost of converting correlations ⋮ Message transmission over classical quantum channels with a jammer with side information: Correlation as resource, common randomness generation ⋮ On a connection between information and group lattices ⋮ Computing quantum discord is NP-complete ⋮ Arbitrarily small amounts of correlation for arbitrarily varying quantum channels ⋮ Strong Secrecy for Multiple Access Channels ⋮ Capacity Results for Arbitrarily Varying Wiretap Channels ⋮ Dimension Reduction for Polynomials over Gaussian Space and Applications ⋮ Search with noisy and delayed response ⋮ On identification