arXiv (All)
open access
Improved Lower Bounds on the Capacity of the Binary Deletion Channel via a Learning Approach to Run-Length Inputs
The capacity $C(d)$ of the i.i.d. binary deletion channel exists by Dobrushin's information-stability theorem, but no closed form is known. Classical constructive lower bounds from i.i.d. run-length coding have been evaluated only for one- or two-parameter families (geometric, Markov, or Morse-type)
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
- A New Upper Bound on the Binary Deletion Channel Capacity#1011220
- Binary Deletion Channel Capacity to Within One Hundredth of a Bit#1014006
- Capacity of a Mixed Multiple-Access Channel with Causal Observation#1037074
- Orbit Reduction and Learned Run Distributions for Finite-Blocklength Binary Deletion Channels#1051286
- Unequal Error Protection for Digital Semantic Communication with Channel Coding#1129097
Record · ID 1051305
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