On the deletion channel with small deletion probability

Jump to other IT Society Websites:

On the deletion channel with small deletion probability


Creation Date: Jun 13, 2010

Published In: Jun 2010

Paper Type: Conference Paper

Book Title: Proc. of IEEE International Symposium on Information Theory

Address: Austin, TX, USA


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.

IEEE Explore link: http://dx.doi.org/10.1109/ISIT.2010.5513745

Award(s) Received:

COVID-19 Updates

Read important changes and updates to the 2020 activities of the IEEE Information Theory Society due to the COVID-19 pandemic at:



Table of Contents

IEEE TechNav