메뉴 건너뛰기




Volumn 1, Issue , 2005, Pages 1-4

Performance comparison between non-binary LDPC codes and reed-solomon codes over noise bursts channels

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DECODING; SPURIOUS SIGNAL NOISE;

EID: 29844447808     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (15)

References (8)
  • 1
    • 0032099205 scopus 로고    scopus 로고
    • Low-density parity check codes over GF(q)
    • June
    • M. C. Davey and D. J. C. MacKay, "Low-density parity check codes over GF(q)" IEEE Commun. Lett., vol. 2, pp. 165-167, June 1998.
    • (1998) IEEE Commun. Lett. , vol.2 , pp. 165-167
    • Davey, M.C.1    MacKay, D.J.C.2
  • 2
    • 84938898610 scopus 로고    scopus 로고
    • Low density parity check codes over GF(q)
    • 22-26th June 1998, Killarney, Ireland
    • M. C. Davey and D. J. C. MacKay, "Low density parity check codes over GF(q)," in Proc. IEEE Inform. Theory Workshop 1998, pp. 70-71, 22-26th June 1998, Killarney, Ireland.
    • (1998) Proc. IEEE Inform. Theory Workshop , pp. 70-71
    • Davey, M.C.1    MacKay, D.J.C.2
  • 3
    • 0030219216 scopus 로고    scopus 로고
    • Near shannon limit performance of low density parity check codes
    • Aug.
    • D. J. C. MacKay and R. M. Neal, "Near shannon limit performance of low density parity check codes," IEEE Electronics Lett., vol. 32, pp. 1645, Aug. 1996.
    • (1996) IEEE Electronics Lett. , vol.32 , pp. 1645
    • MacKay, D.J.C.1    Neal, R.M.2
  • 4
    • 11244291061 scopus 로고    scopus 로고
    • Density evolution method and threshold decision for irregular LDPC codes
    • 27-29th June 2004, ChengDu, China
    • Wang Lin, Xiao Juan, Guanrong Chen, "Density evolution method and threshold decision for irregular LDPC codes," in Proc. IEEE ICCCAS 2004, vol. 1, pp. 25-28, 27-29th June 2004, ChengDu, China.
    • Proc. IEEE ICCCAS 2004 , vol.1 , pp. 25-28
    • Lin, W.1    Juan, X.2    Chen, G.3
  • 6
    • 0019608335 scopus 로고
    • A recursive approach to low complexity codes
    • Sep.
    • R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. 27, pp. 533-547, Sep. 1981.
    • (1981) IEEE Trans. Inform. Theory , vol.27 , pp. 533-547
    • Tanner, R.M.1
  • 7
    • 0033099611 scopus 로고    scopus 로고
    • Good error-correcting codes based on very sparse matrices
    • Mar.
    • D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399-431, Mar. 1999.
    • (1999) IEEE Trans. Inform. Theory , vol.45 , pp. 399-431
    • MacKay, D.J.C.1
  • 8
    • 0035246307 scopus 로고    scopus 로고
    • The capacity of low-density parity-check codes under message-passing decoding
    • Feb.
    • T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, Feb. 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , pp. 599-618
    • Richardson, T.J.1    Urbanke, R.L.2


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