A binary deletion channel with a fixed number of deletions
Probability
2019-02-20 v1 Information Theory
Combinatorics
math.IT
Abstract
Suppose a binary string x = x_1...x_n 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?
Cite
@article{arxiv.1309.1410,
title = {A binary deletion channel with a fixed number of deletions},
author = {Benjamin Graham},
journal= {arXiv preprint arXiv:1309.1410},
year = {2019}
}
Comments
4 pages