Article contents
A Binary Deletion Channel With a Fixed Number of Deletions
Published online by Cambridge University Press: 07 October 2014
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?
Keywords
- Type
- Problem Papers
- Information
- Copyright
- Copyright © Cambridge University Press 2014
References
- 3
- Cited by