Math @ Duke

Publications [#319391] of Henry Pfister
Papers Published
 Diggavi, S; Mitzenmacher, M; Pfister, HD, Capacity upper bounds for the deletion channel,
Ieee International Symposium on Information Theory Proceedings
(December, 2007),
pp. 17161720, IEEE, ISBN 1424414296 [doi]
(last updated on 2019/07/23)
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 appeal to be the fiist nontrivial upper bounds for this probabilistic deletion channel. ©2007 IEEE.


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

