Pages that link to "Item:Q1389262"
From MaRDI portal
The following pages link to Almost independence of random variables and capacity of a secrecy channel (Q1389262):
Displaying 16 items.
- Secrecy results for compound wiretap channels (Q361702) (← links)
- On inequalities between mutual information and variation (Q415703) (← links)
- Generalization of a Pinsker problem (Q764386) (← links)
- Separability and the detection of hidden channels (Q910195) (← links)
- An independence relation for sets of secrets (Q965899) (← links)
- Over-the-Air computation for distributed machine learning and consensus in large wireless networks (Q2106494) (← links)
- Mosaics of combinatorial designs for information-theoretic security (Q2115738) (← links)
- Distillation of secret-key from a class of compound memoryless quantum sources (Q2820903) (← links)
- Randomness and Dependencies Extraction via Polarization, With Applications to Slepian–Wolf Coding and Secrecy (Q2978613) (← links)
- The Sender-Excited Secret Key Agreement Model: Capacity, Reliability, and Secrecy Exponents (Q2978842) (← links)
- Common Randomness and Secret Key Capacities of Two-Way Channels (Q3002104) (← links)
- Strong Secrecy for Multiple Access Channels (Q4915232) (← links)
- Concise and tight security analysis of the Bennett–Brassard 1984 protocol with finite key lengths (Q5137709) (← links)
- Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources (Q5224132) (← links)
- Semantic security for quantum wiretap channels (Q5884874) (← links)
- A lower bound on the share size of leakage-resilient secret-sharing schemes (Q6613363) (← links)
