메뉴 건너뛰기




Volumn 55, Issue 5, 2009, Pages 2055-2061

Error-correction capability of column-weight-three LDPC codes

Author keywords

Error correction capability; Gallager A algorithm; Low density parity check (LDPC) codes; Tanner graph; Trapping sets

Indexed keywords

ERROR-CORRECTION CAPABILITY; GALLAGER A ALGORITHM; LOW-DENSITY PARITY-CHECK (LDPC) CODES; TANNER GRAPH; TRAPPING SETS;

EID: 65749115017     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2009.2015990     Document Type: Article
Times cited : (32)

References (12)
  • 2
    • 0035246307 scopus 로고    scopus 로고
    • The capacity of low-density parity-check codes under message-passing decoding
    • Feb
    • T. J. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
    • (2001) IEEE Trans. Inf. Theory , vol.47 , Issue.2 , pp. 599-618
    • Richardson, T.J.1    Urbanke, R.2
  • 3
    • 0016419451 scopus 로고
    • Estimation of the error-correction complexity for Gallager low-density codes
    • V. V. Zyablov and M. S. Pinsker, "Estimation of the error-correction complexity for Gallager low-density codes," Probl. Inf. Transm., vol. 11, pp. 18-28, 1976.
    • (1976) Probl. Inf. Transm , vol.11 , pp. 18-28
    • Zyablov, V.V.1    Pinsker, M.S.2
  • 4
    • 0030290419 scopus 로고    scopus 로고
    • Expander codes
    • Nov
    • M. Sipser and D. Spielman, "Expander codes," IEEE Trans. Inf. Theory, vol. 42, no. 6, pp. 1710-1722, Nov. 1996.
    • (1996) IEEE Trans. Inf. Theory , vol.42 , Issue.6 , pp. 1710-1722
    • Sipser, M.1    Spielman, D.2
  • 5
    • 0035246481 scopus 로고    scopus 로고
    • Expander graph arguments for message-passing algorithms
    • Feb
    • D. Burshtein and G. Miller, "Expander graph arguments for message-passing algorithms," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 782-790, Feb. 2001.
    • (2001) IEEE Trans. Inf. Theory , vol.47 , Issue.2 , pp. 782-790
    • Burshtein, D.1    Miller, G.2
  • 7
    • 15044355718 scopus 로고    scopus 로고
    • Using linear programming to decode binary linear codes
    • Mar
    • J. Feldman, M. J. Wainwright, and D. R. Karger, "Using linear programming to decode binary linear codes," IEEE Trans. Inf. Theory vol. 51, no. 3, pp. 954-972, Mar. 2005.
    • (2005) IEEE Trans. Inf. Theory , vol.51 , Issue.3 , pp. 954-972
    • Feldman, J.1    Wainwright, M.J.2    Karger, D.R.3
  • 8
    • 51649093808 scopus 로고    scopus 로고
    • On the error correction of regular LDPC codes using the flipping algorithm
    • Jun. 24-29
    • D. Burshtein, "On the error correction of regular LDPC codes using the flipping algorithm," in Proc. Int. Symp. Inf. Theory, Jun. 24-29, 2007, pp. 226-230.
    • (2007) Proc. Int. Symp. Inf. Theory , pp. 226-230
    • Burshtein, D.1
  • 9
    • 0019608335 scopus 로고
    • A recursive approach to low complexity codes
    • Sep
    • R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 533-547, Sep. 1981.
    • (1981) IEEE Trans. Inf. Theory , vol.IT-27 , Issue.5 , pp. 533-547
    • Tanner, R.M.1


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