arXiv (All)
open access
Umlaut information
The sphere-packing bound quantifies the error exponent for noisy channel coding for rates above a critical value. Here, we study the zero-rate limit of the sphere-packing bound and show that it has an intriguing single-letter form, which we call the umlaut information of the channel, inspired by the
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
- New Approximations of Non-Separable MIMO Channels by Separable Channels for Accurate Ergodic Capacity Analysis#616594
- New Approximations of Non-Separable MIMO Channels by Separable Channels for Accurate Ergodic Capacity Analysis#616094
- A Note on Sphere Packing Bounds for Tuple Lattice Sieving#985566
- The Exact Online Threshold for the Asymmetric Binary Perceptron#822524
- Sharp perturbation bounds on the Frobenius norm of subunitary and positive polar factor#1141426
Record · ID 1232588
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