메뉴 건너뛰기




Volumn 7, Issue 4, 2003, Pages 171-173

Graph-theoretic construction of low-density parity-check codes

Author keywords

Low density parity check (LDPC) codes; Sum product algorithm; Tanner graph; Trellis

Indexed keywords

ALGORITHMS; DECODING; GRAPH THEORY; MATRIX ALGEBRA; SET THEORY; TRELLIS CODES;

EID: 0038397549     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2003.809990     Document Type: Article
Times cited : (10)

References (13)
  • 1
    • 84925405668 scopus 로고
    • Low density parity check codes
    • Jan.
    • R. G. Gallager, "Low density parity check codes," IRE Trans. Inform. Theory, vol. IT-18, pp. 21-28, Jan. 1962.
    • (1962) IRE Trans. Inform. Theory , vol.IT-18 , pp. 21-28
    • Gallager, R.G.1
  • 3
    • 0035246580 scopus 로고    scopus 로고
    • Improved low-density parity-check codes using irregular graphs and belief propagation
    • Feb.
    • M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Improved low-density parity-check codes using irregular graphs and belief propagation," IEEE Trans. Inform. Theory, vol. 47, pp. 585-598, Feb. 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , pp. 585-598
    • Luby, M.G.1    Mitzenmacher, M.2    Shokrollahi, M.A.3    Spielman, D.A.4
  • 4
    • 0035246127 scopus 로고    scopus 로고
    • Design of capacity-approaching irregular low-density parity-check codes
    • Feb.
    • T. J. Richardson, M. 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.J.1    Shokrollahi, M.A.2    Urbanke, R.3
  • 5
    • 0034857480 scopus 로고    scopus 로고
    • Constructions of regular and irregular LDPC codes using Ramanujan graphs and ideas from Margulis
    • J. Rosenthal and P. O. Vontobel, "Constructions of regular and irregular LDPC codes using Ramanujan graphs and ideas from Margulis," in Proc. IEEE Int. Symp. Inform. Theory, June 2001, p. 4.
    • Proc. IEEE Int. Symp. Inform. Theory, June 2001 , pp. 4
    • Rosenthal, J.1    Vontobel, P.O.2
  • 9
    • 0019608335 scopus 로고
    • A recursive approach to low complexity codes
    • Sept.
    • R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sept. 1981.
    • (1981) IEEE Trans. Inform. Theory , vol.IT-27 , pp. 533-547
    • Tanner, R.M.1
  • 13
    • 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-432, Mar. 1999.
    • (1999) IEEE Trans. Inform. Theory , vol.45 , pp. 399-432
    • MacKay, D.J.C.1


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