메뉴 건너뛰기




Volumn 50, Issue 10, 2004, Pages 2483-2489

Bounds on achievable rates of LDPC codes used over the binary erasure channel

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CAPACITY; CODES (SYMBOLS); DECODING; DIFFERENTIATION (CALCULUS); ITERATIVE METHODS; POLYNOMIALS; PROBABILITY; THEOREM PROVING;

EID: 5144222246     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.834845     Document Type: Article
Times cited : (15)

References (10)
  • 2
    • 0001780655 scopus 로고
    • Coding for two noisy channels
    • Third London Symp., London, U.K
    • P. Elias, "Coding for two noisy channels," in Proc. Information Theory, Third London Symp., London, U.K., 1955.
    • (1955) Proc. Information Theory
    • Elias, P.1
  • 5
    • 84957715479 scopus 로고    scopus 로고
    • New sequences of linear time erasure codes approaching the channel capacity
    • Berlin, Germany: Springer-Verlag
    • M. A. Shokrollahi, "New sequences of linear time erasure codes approaching the channel capacity," in Proc. AAECC-13 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1999, vol. 1719, pp. 65-76.
    • (1999) Proc. AAECC-13 (Lecture Notes in Computer Science) , vol.1719 , pp. 65-76
    • Shokrollahi, M.A.1
  • 7
    • 0038105247 scopus 로고    scopus 로고
    • Parity-check density versus performance of binary linear block codes over memoryless symmetric channel
    • July
    • I. Sason and R. Urbanke, "Parity-check density versus performance of binary linear block codes over memoryless symmetric channel," IEEE Trans. Inform. Theory, vol. 49, pp. 1611-1635, July 2003.
    • (2003) IEEE Trans. Inform. Theory , vol.49 , pp. 1611-1635
    • Sason, I.1    Urbanke, R.2
  • 8
    • 0035246127 scopus 로고    scopus 로고
    • Design of capacity-approaching irregular low-density parity-check codes
    • Feb
    • T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, Feb. 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , pp. 619-637
    • Richardson, T.1    Shokrollahi, A.2    Urbanke, R.3
  • 10
    • 0036913621 scopus 로고    scopus 로고
    • Capacity-achieving sequences for the erasure channel
    • Dec
    • P. Oswald and M. A. Shokrollahi, "Capacity-achieving sequences for the erasure channel," IEEE Trans. Inform. Theory, vol. 48, pp. 3017-3028, Dec. 2002.
    • (2002) IEEE Trans. Inform. Theory , vol.48 , pp. 3017-3028
    • Oswald, P.1    Shokrollahi, M.A.2


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