Capacity upper bounds for the deletion channel
Diggavi, Suhas; Mitzenmacher, Michael; Pfister, Henry D.
2007

Abstract

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 appear to be the first non-trivial upper bounds for this probabilistic deletion channel.

Details

Title Capacity upper bounds for the deletion channel
Author(s) Diggavi, Suhas ; Mitzenmacher, Michael ; Pfister, Henry D.
Published in 2007 Ieee International Symposium On Information Theory Proceedings
Pages 1716-1720
Conference IEEE International Symposium on Information Theory, Nice, FRANCE, Jun 24-29, 2007
Date 2007
Publisher Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa
ISBN 978-1-4244-1397-3
DOI https://doi.org/10.1109/ISIT.2007.4557469
Other identifier(s) View record in Web of Science
Laboratories LICOS
Record Appears in Scientific production and competences > I&C - School of Computer and Communication Sciences > IC Archives > LICOS - Information and Communication Systems Laboratory
Conference Papers
Work produced at EPFL
Published
Record creation date 2012-07-04

Actions