Papers
Topics
Authors
Recent
Search
2000 character limit reached

A New Upper Bound on the Binary Deletion Channel Capacity

Published 11 Sep 2026 in cs.IT | (2609.13351v1)

Abstract: We prove that the capacity of the binary deletion channel satisfies C(d)≤(1−d)/4C(d)\le (1-d)/4 for every 13/20≤d<113/20\le d<1. The proof describes the output from right to left, using a six-bit context to assign a description length. We bound the increase in expected description length minus output entropy when one input bit is added. A relative-entropy identity reduces this bound to finitely many linear inequalities. A potential on input windows of length 26 makes the inequalities telescope, giving a bound for every input word. Deletion composition extends the result from d=13/20d=13/20 to all larger deletion probabilities. We also obtain finite-block bounds on mutual information and decoding error, with explicit O(log⁡n/n)O(\log n/n) corrections. The finite certificate is checked using exact integer arithmetic, and the proof is formalized end to end in Lean.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.