A simple lower bound for the capacity of the deletion channel

IEEE Transactions on Information Theory

Volumn 52, Issue 10, 2006, Pages 4657-4660

  Mitzenmacher, Michael ^a,b   Drinea, Eleni ^b  

^a IEEE   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

Binary deletion channel; Channel capacity; Insertion and or deletion channels

Indexed keywords

BINARY DELETION CHANNEL; DELETION CHANNELS; INSERTION CHANNELS;

BINARY CODES; COMMUNICATION CHANNELS (INFORMATION THEORY); PROBABILITY;

CHANNEL CAPACITY;

EID: 33947373872     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.881844     Document Type: Article

References (4)

1. S. Diggavi and M. Grossglauser, "On information transmission over a finite buffer channel," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 1226-1237, Mar. 2006.
2. E. Drinea and M. Mitzenmacher, "On lower bounds for the capacity of deletion channels," IEEE Trans. Inf. Theory, vol. 52, no. 10, pp. 4648-4657, Oct. 2006.
3. _, "Improved lower bounds for i.i.d. deletion and insertion channels," IEEE Trans. Inf. Theory, submitted for publication.
4. M. Mitzenmacher and E. Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge, U.K.: Cambridge Univ. Press, 2005.