On lower bounds for the capacity of deletion channels

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2004, Pages 227-

  Drinea, Eleni ^a   Mitzenmacher, Michael ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODEBOOKS; DASES; DELETION CHANNELS; GEOMETRIC DISTRIBUTION;

BIT ERROR RATE; CODES (SYMBOLS); COMPUTATIONAL GEOMETRY; DECODING; ERRORS; MARKOV PROCESSES; PROBABILITY;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 5044244785     PISSN: 21578097     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (3)

1. S. Diggavi and M. Grossglauser, On Transmission over Deletion Channels, Allerton Conference, Monticello, Illinois, October 2001.
2. N. J. A. Sloane, On Single-Deletion-Correcting Codes, appeared in Ray-Chaudhuri Festschrift 2001, URL: http://www.research.att.com/~njas/docs/dijen.ps.
3. B. Drinea, M. Mitzenmacher, On lower bounds for the capacity of deletion channels, Harvard Computer Science Technical Report TR-07-04.