A Simple Lower Bound for the Capacity of the Deletion Channel

Authors:
M. Mitzenmacher;E. Drinea
Affiliations:
Div. of Eng. & Appl. Sci., Harvard Univ., Cambridge, MA;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 6

A Survey of Results for Deletion Channels and Related Synchronization Channels

SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Improving wireless security through network diversity

ACM SIGCOMM Computer Communication Review
Communication under strong asynchronism

IEEE Transactions on Information Theory
Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications

IEEE Transactions on Information Theory
Codes for deletion and insertion channels with segmented errors

IEEE Transactions on Information Theory
Novel bounds on the capacity of the binary deletion channel

IEEE Transactions on Information Theory

Quantified Score

Hi-index	755.08

Visualization

Abstract

We present a simple proof that the capacity of the binary independent and identically distributed (i.i.d.) deletion channel, where each bit is deleted independently with probability d, is at least (1-d)/9, by developing a correspondence between the deletion channel and an insertion/deletion channel that we call a Poisson-repeat channel