The Library
A binary deletion channel with a fixed number of deletions
Tools
Tools
Tools
Graham, Benjamin T. (2015) A binary deletion channel with a fixed number of deletions. Combinatorics, Probability and Computing, 24 (3). pp. 486-489. doi:10.1017/S0963548314000522
Research output not available from this repository, contact author.
Official URL: http://dx.doi.org/10.1017/S0963548314000522
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?
| Item Type: | Journal Article | ||||||||
|---|---|---|---|---|---|---|---|---|---|
| Divisions: | Faculty of Science > Statistics | ||||||||
| Journal or Publication Title: | Combinatorics, Probability and Computing | ||||||||
| Publisher: | Cambridge University Press | ||||||||
| ISSN: | 0963-5483 | ||||||||
| Official Date: | May 2015 | ||||||||
| Dates: |
|
||||||||
| Volume: | 24 | ||||||||
| Number: | 3 | ||||||||
| Page Range: | pp. 486-489 | ||||||||
| DOI: | 10.1017/S0963548314000522 | ||||||||
| Status: | Peer Reviewed | ||||||||
| Publication Status: | Published | ||||||||
| Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
