Capacity upper bounds for the deletion channel
Publication
, Conference
Diggavi, S; Mitzenmacher, M; Pfister, HD
Published in: IEEE International Symposium on Information Theory Proceedings
December 1, 2007
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.
Duke Scholars
Published In
IEEE International Symposium on Information Theory Proceedings
DOI
Publication Date
December 1, 2007
Start / End Page
1716 / 1720
Citation
APA
Chicago
ICMJE
MLA
NLM
Diggavi, S., Mitzenmacher, M., & Pfister, H. D. (2007). Capacity upper bounds for the deletion channel. In IEEE International Symposium on Information Theory Proceedings (pp. 1716–1720). https://doi.org/10.1109/ISIT.2007.4557469
Diggavi, S., M. Mitzenmacher, and H. D. Pfister. “Capacity upper bounds for the deletion channel.” In IEEE International Symposium on Information Theory Proceedings, 1716–20, 2007. https://doi.org/10.1109/ISIT.2007.4557469.
Diggavi S, Mitzenmacher M, Pfister HD. Capacity upper bounds for the deletion channel. In: IEEE International Symposium on Information Theory Proceedings. 2007. p. 1716–20.
Diggavi, S., et al. “Capacity upper bounds for the deletion channel.” IEEE International Symposium on Information Theory Proceedings, 2007, pp. 1716–20. Scopus, doi:10.1109/ISIT.2007.4557469.
Diggavi S, Mitzenmacher M, Pfister HD. Capacity upper bounds for the deletion channel. IEEE International Symposium on Information Theory Proceedings. 2007. p. 1716–1720.
Published In
IEEE International Symposium on Information Theory Proceedings
DOI
Publication Date
December 1, 2007
Start / End Page
1716 / 1720