메뉴 건너뛰기




Volumn 56, Issue 6, 2010, Pages 2753-2765

Novel bounds on the capacity of the binary deletion channel

Author keywords

Binary deletion channel; Capacity bounds; Channel capacity

Indexed keywords

AUXILIARY PROCESS; BINARY DELETION CHANNEL; CAPACITY BOUND; INFINITE SERIES; LOWER BOUNDS; UPPER BOUND;

EID: 77955702604     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2010.2046210     Document Type: Article
Times cited : (60)

References (13)
  • 1
    • 33747478454 scopus 로고
    • Shannon's theorems for channels with synchronization errors
    • R. L. Dobrushin, "Shannon's theorems for channels with synchronization errors," Probl. Inf. Transmission, vol.3, no.4, pp. 11-26, 1967.
    • (1967) Probl. 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, no.8, pp. 2693-2714, Aug. 2007.
    • (2007) IEEE Trans. Inf. Theory , vol.53 , Issue.8 , pp. 2693-2714
    • Drinea, E.1    Mitzenmacher, M.2
  • 5
    • 34547857690 scopus 로고    scopus 로고
    • Directly lower bounding the information capacity for channels with I.I.D. deletions and duplications
    • E. Drinea and A. Kirsch, "Directly lower bounding the information capacity for channels with I.I.D. deletions and duplications," in Proc. IEEE Int. Symp. Information Theory, 2007, pp. 1731-1735.
    • (2007) Proc. IEEE Int. Symp. Information Theory , pp. 1731-1735
    • Drinea, E.1    Kirsch, A.2
  • 6
    • 0002188959 scopus 로고
    • On the capabilites of codes to correct synchronization errors
    • Jan.
    • J. D. Ullman, "On the capabilites of codes to correct synchronization errors," IEEE Trans. Inf. Theory, vol.13, no.1, pp. 95-105, Jan. 1967.
    • (1967) IEEE Trans. Inf. Theory , vol.13 , Issue.1 , pp. 95-105
    • Ullman, J.D.1
  • 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, no.1, pp. 460-473, Jan. 1972.
    • (1972) IEEE Trans. Inf. Theory , vol.18 , Issue.1 , 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, no.1, pp. 14-20, Jan. 1972.
    • (1972) IEEE Trans. Inf. Theory , vol.18 , Issue.1 , pp. 14-20
    • Arimoto, S.1
  • 11
    • 33947373872 scopus 로고    scopus 로고
    • A simple lower bound for the capacity of the deletion channel
    • DOI 10.1109/TIT.2006.881844
    • 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. (Pubitemid 46445302)
    • (2006) IEEE Transactions on Information Theory , vol.52 , Issue.10 , pp. 4657-4660
    • Mitzenmacher, M.1    Drinea, E.2
  • 12
    • 79551685591 scopus 로고    scopus 로고
    • Bounds on the capacity of channels with insertions, deletions and substitutions
    • submitted for publication
    • D. Fertonani and T. M. Duman, "Bounds on the capacity of channels with insertions, deletions and substitutions," IEEE Trans. Commun., submitted for publication.
    • IEEE Trans. Commun.
    • Fertonani, D.1    Duman, T.M.2
  • 13
    • 38349116799 scopus 로고    scopus 로고
    • Capacity bounds for sticky channels
    • Jan.
    • M. Mitzenmacher, "Capacity bounds for sticky channels," IEEE Trans. Inf. Theory, vol.54, no.1, pp. 72-77, Jan. 2008.
    • (2008) IEEE Trans. Inf. Theory , vol.54 , Issue.1 , pp. 72-77
    • Mitzenmacher, M.1


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