Capacity bounds for sticky channels

IEEE Transactions on Information Theory

Volumn 54, Issue 1, 2008, Pages 72-77

  Mitzenmacher, Michael ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Capacity bounds; Duplication channels; Insertion deletion channels; Sticky channels

Indexed keywords

CHANNEL CAPACITY; CODES (SYMBOLS);

CAPACITY BOUNDS; DUPLICATION CHANNELS; STICKY CHANNELS;

COMMUNICATION CHANNELS (INFORMATION THEORY);

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

References (8)

1. K. A. S. Abdel-Ghaffar, "Capacity per unit cost of a discrete memory-less channel," IEE Electron. Lett., vol. 29, pp. 142-144, 1993.
2. S. Diggavi and M. Grossglauser, "Information transmission over a finite buffer channels," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 1226-1237, Mar. 2006.
3. S. Diggavi, M. Mitzenmacher, and H. Pfister, "Capacity upper bounds for deletion channels," in Proc. IEEE Int. Symp. Information Theory, Nice, France, Jun. 2007, pp. 1716-1720.
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. 2007.
5. E. Drinea and M. Mitzenmacher, "Improved lower bounds for the capacity of i.i.d. deletion and duplication channels," IEEE Trans. Inf. Theory, vol. 53, no. 8, pp. 2693-2714, Aug. 2007.
6. M. Jimbo and K. Kunisawa, "An Iteration Method for Calculating the Relative Capacity," Inf. Contr., vol. 43, pp. 216-233, 1979.
7. 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. 2006.
8. S. Verdú, "On channel capacity per unit cost," IEEE Trans. Inf. Theory, vol. 36, no. 5, pp. 1019-1030, Sep. 1990.