메뉴 건너뛰기




Volumn 7, Issue 7, 2003, Pages 317-319

A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols

Author keywords

Low density parity check codes (LDPCs); Reed Solomon codes; Sum product algorithm

Indexed keywords

ALGEBRA; ALGORITHMS; DECODING; GRAPH THEORY; ITERATIVE METHODS;

EID: 0042092025     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2003.814716     Document Type: Article
Times cited : (186)

References (11)
  • 2
    • 0030219216 scopus 로고    scopus 로고
    • Near Shannon limit performance of low density parity check codes
    • D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," Electron. Lett., vol. 32, no. 18, pp. 1645-1646, 1996.
    • (1996) Electron. Lett. , vol.32 , Issue.18 , pp. 1645-1646
    • Mackay, D.J.C.1    Neal, R.M.2
  • 4
    • 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
  • 5
    • 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
  • 6
    • 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. 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.2
  • 7
    • 0035248618 scopus 로고    scopus 로고
    • On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
    • Feb.
    • S.-Y. Chung, G. D. Forney Jr, T. J. Richardson, and R. Urbanke, "On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit," IEEE Communun. Lett., vol. 5, pp. 58-60, Feb. 2001.
    • (2001) IEEE Communun. Lett. , vol.5 , pp. 58-60
    • Chung, S.-Y.1    Forney G.D., Jr.2    Richardson, T.J.3    Urbanke, R.4
  • 8
    • 0035504019 scopus 로고    scopus 로고
    • Low density parity check codes: A rediscovery and new results
    • Nov.
    • Y. Kou, S. Lin, and M. Fossorier, "Low density parity check codes: A rediscovery and new results," IEEE Trans. Inform. Theory, vol. 47, pp. 2711-2736, Nov. 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , pp. 2711-2736
    • Kou, Y.1    Lin, S.2    Fossorier, M.3
  • 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


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