Bounds on the capacity of deletion channels

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2002, Pages 421-

  Diggavi, Suhas N ^a   Grossglauser, Matthias ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PACKET LOSS CHANNELS;

BINARY SEQUENCES; CODES (SYMBOLS); COMMUNICATION CHANNELS (INFORMATION THEORY); ENCODING (SYMBOLS); MARKOV PROCESSES; OPTIMIZATION; PACKET NETWORKS; PROBABILITY; QUEUEING NETWORKS; THEOREM PROVING;

CHANNEL CAPACITY;

EID: 0036350162     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (2)

1. Sequential decoding for binary channels with noise and synchronization errors
2. Sequential decoding for a binary channel with drop-outs and insertions