A binary deletion channel with a fixed number of deletions
Abstract
Suppose a binary string x = x1...xn is being broadcast repeatedly over a faulty communication channel. Each time, the channel delivers a fixed number m of the digits (m<n) with the lost digits chosen uniformly at random, and the order of the surviving digits preserved. How large does m have to be to reconstruct the message?
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.