Improved lower bounds for the capacity of i.i.d. deletion and duplication channels

IEEE Transactions on Information Theory

Volumn 53, Issue 8, 2007, Pages 2693-2714

  Drinea, Eleni ^a   Mitzenmacher, Michael ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Binary deletion channel; Channel capacity; Channels with synchronization errors

Indexed keywords

BOUNDARY CONDITIONS; CHANNEL CAPACITY; ERRORS; GEOMETRY; PROBABILITY; SYNCHRONIZATION;

BINARY DELETION CHANNEL; LOWER BOUNDS; SYNCHRONIZATION ERRORS;

COMMUNICATION CHANNELS (INFORMATION THEORY);

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

References (12)

1. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
2. S. Diggavi and M. Grossglauser, IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 1226-1237, Mar. 2006.
3. E. Drinea and A. Kirsch, "Directly lower bounding the information capacity for channels with i.i.d. deletions and duplications," in Proc. IEEE Int. Symp. Information Theory, Nice, France, Jun. 2007, pp. 1731-1735.
4. 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.
5. R. L. Dobrushin, "Shannon's theorems for channels with synchronization errors," Probl. Inf. Transm., vol. 3, no. 4, pp. 11-26, 1967, translated from Probl. Pered. Inform., vol. 3, no. 4, pp 18-36, 1967.
6. A. S. Dolgopolov, "Capacity bounds for a channel with synchronization errors," Probl. Inf. Transm., vol. 26, no. 2, pp. 111-120, 1990, Translated from Probl. Pered. Inform., vol. 26, no. 2, pp 27-37, April-June, 1990.
7. R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics. Reading, MA: Addison-Wesley, 1988.
8. A. Kavčć and R. Motwani, "Insertion/deletion channels: Reduced-state lower bounds on channel capacities," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, p. 229.
9. M. Mitzenmacher and E. Drinea, "A simple lower bound for the capacity of the deletion channel," IEEE Trans. Inf. Theory, vol. 52, no. 10, pp. 4657-4660, Oct. 2007.
10. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1995.
11. J. D. Ullman, "On the capabilities of codes to correct synchronization errors," IEEE Trans. Inf. Theory, vol. IT-13, no. 1, pp. 95-105, Jan. 1967.
12. N. D. Vvedenskaya and R. L. Dobrushin, "The computation on a computer of the channel capacity of a line with symbol drop-out," Probl. Inf. Transm., vol. 4, no. 3, pp. 76-79, 1968, Translated from Probl. Pered. Inform., vol. 4, no. 3, pp 92-95, 1968.