Pages that link to "Item:Q4392448"
From MaRDI portal
The following pages link to Common randomness in information theory and cryptography. II. CR capacity (Q4392448):
Displayed 13 items.
- On a connection between information and group lattices (Q657554) (← links)
- Aspects of generic entanglement (Q863129) (← links)
- Public and private resource trade-offs for a quantum channel (Q1939452) (← links)
- Common randomness and distributed control: A counterexample (Q2643484) (← links)
- Search with noisy and delayed response (Q3439235) (← links)
- On identification (Q3439276) (← links)
- Strong Secrecy for Multiple Access Channels (Q4915232) (← links)
- Capacity Results for Arbitrarily Varying Wiretap Channels (Q4915233) (← links)
- Dimension Reduction for Polynomials over Gaussian Space and Applications (Q5121916) (← links)
- Message transmission over classical quantum channels with a jammer with side information: Correlation as resource, common randomness generation (Q5136157) (← links)
- Computing quantum discord is NP-complete (Q5143185) (← links)
- Arbitrarily small amounts of correlation for arbitrarily varying quantum channels (Q5410942) (← links)
- One-message secure reductions: on the cost of converting correlations (Q6186603) (← links)