arXiv (All)
open access
The Arbitrarily Varying Wiretap Channel - Secret Randomness, Stability and Super-Activation
We define the common randomness assisted capacity of an arbitrarily varying channel (AVWC) when the Eavesdropper is kept ignorant about the common randomness. We prove a multi-letter capacity formula for this model. We prove that, if enough common randomness is used, the capacity formula can be give
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Privacy, Prediction, and Allocation#31218
- Simple Finite-Length Achievability and Converse Bounds for the Deletion Channel and the Insertion Channel#139156
- Reply to the Comment on "The Axiom of Choice and the No-Signalling Principle"#927617
- Optimal Temporal Hiding in Correlated Quantum Reference-Frame Processes#1013105
- Sharing-oriented Resource Allocation for Multi-platoon's Groupcasting and Unicasting Communication based on the Transmission Reliability#138882
Record · ID 1036497
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive