메뉴 건너뛰기




Volumn 59, Issue 1, 2011, Pages 2-6

Bounds on the capacity of channels with insertions, deletions and substitutions

Author keywords

Binary channels; capacity bounds; channel capacity; insertion deletion errors; substitution errors

Indexed keywords

AUXILIARY SYSTEMS; BINARY CHANNELS; BLAHUT-ARIMOTO ALGORITHM; CAPACITY BOUND; CAPACITY LOWER BOUND; INSERTION/DELETION ERRORS; MEMORYLESS CHANNELS; SUBSTITUTION ERRORS; UPPER BOUND;

EID: 79551685591     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2010.110310.090039     Document Type: Article
Times cited : (48)

References (11)
  • 2
    • 38349116799 scopus 로고    scopus 로고
    • Capacity bounds for sticky channels
    • Jan.
    • M. Mitzenmacher, "Capacity bounds for sticky channels," IEEE Trans. Inf. Theory, vol. 54, pp. 72-77, Jan. 2008.
    • (2008) IEEE Trans. Inf. Theory , vol.54 , pp. 72-77
    • Mitzenmacher, M.1
  • 3
    • 33747478454 scopus 로고
    • Shannon's theorems for channels with synchronization errors
    • R. L. Dobrushin, "Shannon's theorems for channels with synchronization errors," Problems Inf. Transmission, vol. 3, no. 4, pp. 11-26, 1967.
    • (1967) Problems Inf. Transmission , vol.3 , Issue.4 , pp. 11-26
    • Dobrushin, R.L.1
  • 4
    • 34547915642 scopus 로고    scopus 로고
    • Improved lower bounds for the capacity of i.i.d. deletion and duplication channels
    • Aug.
    • 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, pp. 2693-2714, Aug. 2007.
    • (2007) IEEE Trans. Inf. Theory , vol.53 , pp. 2693-2714
    • Drinea, E.1    Mitzenmacher, M.2
  • 5
    • 73849141908 scopus 로고    scopus 로고
    • Directly lower bounding the information capacity for channels with I.I.D. deletions and duplications
    • Jan.
    • A. Kirsch and E. Drinea, "Directly lower bounding the information capacity for channels with I.I.D. deletions and duplications," IEEE Trans. Inf. Theory, vol. 56, no. 1, pp. 86-102, Jan. 2010.
    • (2010) IEEE Trans. Inf. Theory , vol.56 , Issue.1 , pp. 86-102
    • Kirsch, A.1    Drinea, E.2
  • 7
    • 77955702604 scopus 로고    scopus 로고
    • Novel bounds on the capacity of the binary deletion channel
    • June
    • D. Fertonani and T. M. Duman, "Novel bounds on the capacity of the binary deletion channel," IEEE Trans. Inf. Theory, vol. 56, no. 6, pp. 2753-2765, June 2010.
    • (2010) IEEE Trans. Inf. Theory , vol.56 , Issue.6 , pp. 2753-2765
    • Fertonani, D.1    Duman, T.M.2
  • 8
    • 0015376113 scopus 로고
    • Computation of channel capacity and rate distortion functions
    • Jan.
    • R. E. Blahut, "Computation of channel capacity and rate distortion functions," IEEE Trans. Inf. Theory, vol. 18, pp. 460-473, Jan. 1972.
    • (1972) IEEE Trans. Inf. Theory , vol.18 , pp. 460-473
    • Blahut, R.E.1
  • 9
    • 0015287895 scopus 로고
    • An algorithm for calculating the capacity of an arbitrary discrete memoryless channel
    • Jan.
    • S. Arimoto, "An algorithm for calculating the capacity of an arbitrary discrete memoryless channel," IEEE Trans. Inf. Theory, vol. 18, pp. 14-20, Jan. 1972.
    • (1972) IEEE Trans. Inf. Theory , vol.18 , pp. 14-20
    • Arimoto, S.1
  • 11
    • 0035246117 scopus 로고    scopus 로고
    • Reliable communication over channels with insertions, deletions, and substitutions
    • Feb.
    • M. C. Davey and D. J. C. MacKay, "Reliable communication over channels with insertions, deletions, and substitutions," IEEE Trans. Inf. Theory, vol. 47, pp. 687-698, Feb. 2001.
    • (2001) IEEE Trans. Inf. Theory , vol.47 , pp. 687-698
    • Davey, M.C.1    MacKay, D.J.C.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.