On the deletion channel with small deletion probability
Authors:
- 1 June 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3 (21578095) , 1002-1006
Abstract
The deletion channel is the simplest point-to-point communication channel that models lack of synchronization. Despite significant effort, little is known about its capacity, and even less about optimal coding schemes. In this paper we initiate a new systematic approach to this problem, by demonstrating that capacity can be computed in a series expansion for small deletion probability.We compute two leading terms of this expansion, and show that capacity is achieved, up to this order, by i.i.d. uniform random distribution of the input. We think that this strategy can be useful in a number of capacity calculations.Keywords
All Related Versions
This publication has 4 references indexed in Scilit:
- On the deletion channel with small deletion probability2010
- Novel bounds on the capacity of binary channels with deletions and substitutions2009
- A survey of results for deletion channels and related synchronization channelsProbability Surveys, 2009
- Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication ChannelsIEEE Transactions on Information Theory, 2007