Capacity upper bounds for the deletion channel

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 1716-1720

  Diggavi, Suhas ^a   Mitzenmacher, Michael ^b   Pfister, Henry D ^c  

^a EPFL   (Switzerland)

^b HARVARD UNIVERSITY   (United States)

^c Texas AandM University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNATIONAL SYMPOSIUM; UPPER BOUNDS;

PROBABILITY; TECHNICAL PRESENTATIONS;

INFORMATION THEORY;

EID: 38349179971     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2007.4557469     Document Type: Conference Paper

References (17)

1. S. N. Diggavi and M. Grossglauser, "On transmission over deletion channels," in Proc. Annual Allerion Conf. on Commun., Control, and Comp., (Monticello, Illinois), Oct. 2001.
2. S. N. Diggavi and M. Grossglauser, "Information transmission over finite buffer channels," IEEE Trans. Inform. Theory, vol. 52, pp. 1226-1237, March 2006.
3. A. Kavčić and R. Motwani, "Insertion/deletion channels: Reduced-state lower bounds on channel capacities," in Proc. IEEE Int. Symp. Information Theory, (Chicago, Illinois), p. 229, June 2004.
4. E Drinea and M. Mitzenmacher, "Improved lower bounds for the capacity of deletion channels," in Proc. Annual Allerton Conf. on Commun., Control, and Comp., (Monticello, Illinois), Oct. 2004.
5. E Drinea and M Mitzenmacher, "On lower bounds for the capacity of the deletion channel," IEEE Trans. Inform. Theory, vol. 52, pp. 4648-4657, Oct. 2006.
6. E Drinea and M. Mitzenmacher, "Improved lower bounds for the capacity of i.i.d. deletion and duplication channels," [Online]. Available: http://www.eecs.harvard.edu/∼michaelm/postscripts/toitsubmita.ps.
7. M. Mitzenmacher and E Drinea, "A simple lower bound for the capacity of the deletion channel.," IEEE Trans. Inform. Theory, vol. 52, pp. 4657-4660, Oct. 2006.
8. V. I. Levenshtein, "Binary codes capable of correcting deletions, insertions and reversals," Soviet Physics - Doklady, vol. 10, pp. 707-710, February 1966.
9. R. L. Dobrushin, "Shannon's theorems for channels with synchronization errors," Problems of Inform. Transm., vol. 3, no. 4, pp. 11-26, 1967.
10. N. J. A. Sloane, "On single - deletion - correcting codes." In D. Ray-Chaudhuri Festschrift, 2001. [Online]. Available: http://www.research. att.com/∼njas/doc/dijen.ps.
11. R. G. Gallager, "Sequential decoding for binary channels with noise and synchronization errors." Lincoln Lab. Group Report, Oct. 1961.
12. K. S. Zigangirov, "Sequential decoding for a binary channel with dropouts and insertions," Problems of Inform. Transm., vol. 5, no. 2, pp. 17-22, 1969.
13. J. D. Ullman, "On the capabilities of codes to correct synchronization errors," IEEE Trans. Inform. Theory, vol. 13, pp. 95-105, Jan. 1967.
14. E Drinea and M. Mitzenmacher, "On lower bounds for the capacity of deletion channels," in Proc. IEEE Int. Symp. Information Theory, (Chicago, Illinois), p. 227, June 2004.
15. M. Mitzenmacher, "Capacity bounds for sticky channels," [Online]. Available: http://www.eecs.harvard.edu/∼michaelm/postscripts/ submitisit2007a. pdf.
16. K. A. S. Abdel-Ghaffar, "Capacity per unit cost of a discrete memoryless channel," Electronic Letters, vol. 29, pp. 142-144, Jan. 1993.
17. R. G. Gallager, Information theory and reliable communications. New York: John Wiley and Sons, 1968.