科研之友
微信
新浪微博
Facebook
分享链接
摘要
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?
- 出版日期2015-5
