A Binary Deletion Channel With a Fixed Number of Deletions. (7th October 2014)
- Record Type:
- Journal Article
- Title:
- A Binary Deletion Channel With a Fixed Number of Deletions. (7th October 2014)
- Main Title:
- A Binary Deletion Channel With a Fixed Number of Deletions
- Authors:
- GRAHAM, BENJAMIN
- Abstract:
- Abstract : Suppose a binary stringx = x 1 . . . 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?
- Is Part Of:
- Combinatorics, probability and computing. Volume 24:Number 3(2015:May)
- Journal:
- Combinatorics, probability and computing
- Issue:
- Volume 24:Number 3(2015:May)
- Issue Display:
- Volume 24, Issue 3 (2015)
- Year:
- 2015
- Volume:
- 24
- Issue:
- 3
- Issue Sort Value:
- 2015-0024-0003-0000
- Page Start:
- 486
- Page End:
- 489
- Publication Date:
- 2014-10-07
- Subjects:
- Primary 68R05, -- Secondary 68P30
Combinatorial analysis -- Periodicals
Probabilities -- Periodicals
Computer science -- Mathematics -- Periodicals
511.6 - Journal URLs:
- http://journals.cambridge.org/action/displayJournal?jid=CPC ↗
- DOI:
- 10.1017/S0963548314000522 ↗
- Languages:
- English
- ISSNs:
- 0963-5483
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library STI - ELD Digital Store
- Ingest File:
- 4590.xml