By Topic

Bounds on the capacity of deletion channels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Diggavi, S.N. ; AT&T Shannon Labs., Florham Park, NJ, USA ; Grossglauser, Matthias

In this paper, we develop bounds on the achievable rate for deletion channels. Deletion channels occur when symbols are randomly dropped, and a subsequence of the transmitted symbols is received. Our initial motivation for studying these channels arose in the context of information transmission over finite-buffer queues in packet-switched networks, where the receiver does not have access to side-information on which packets were dropped. This also motivated our study on the effect of large alphabet sizes on the achievable rate.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference:

2002