Capacity upper bounds for the deletion channel


Conference Paper

We present two upper bounds on the capacity of the i.i.d. binary deletion channel, where each bit is independently deleted with a fixed probability d. The first can be numerically evaluated for any fixed d. The second provides an asymptotic upper bound as d goes to 1. These appeal to be the fiist non-trivial upper bounds for this probabilistic deletion channel. ©2007 IEEE.

Full Text

Duke Authors

Cited Authors

  • Diggavi, S; Mitzenmacher, M; Pfister, HD

Published Date

  • December 1, 2007

Published In

  • Ieee International Symposium on Information Theory Proceedings

Start / End Page

  • 1716 - 1720

International Standard Book Number 10 (ISBN-10)

  • 1424414296

International Standard Book Number 13 (ISBN-13)

  • 9781424414291

Digital Object Identifier (DOI)

  • 10.1109/ISIT.2007.4557469

Citation Source

  • Scopus