메뉴 건너뛰기




Volumn , Issue , 2001, Pages 90-92

Regular low-density parity-check codes from combinatorial designs

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; SATELLITE COMMUNICATION SYSTEMS; TURBO CODES;

EID: 84938915656     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2001.955146     Document Type: Conference Paper
Times cited : (75)

References (15)
  • 1
    • 84925405668 scopus 로고
    • Low-density parity-check codes
    • January
    • R. G. Gallager, "Low-density parity-check codes," IRE Trans. Information Theory, vol. IT-8, no. 1, pp. 21-28, January 1962.
    • (1962) IRE Trans. Information Theory , vol.IT-8 , Issue.1 , pp. 21-28
    • Gallager, R.G.1
  • 2
    • 0030219216 scopus 로고    scopus 로고
    • Near shannon limit performance of low density parity check codes
    • March
    • D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," Electronics Letters, vol. 32, no. 18, pp. 1645-1646, March 1997.
    • (1997) Electronics Letters , vol.32 , Issue.18 , pp. 1645-1646
    • MacKay, D.J.C.1    Neal, R.M.2
  • 3
    • 0019608335 scopus 로고
    • A recursive approach to low complexity codes
    • September
    • R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, no. 5, pp. 533-547, September 1981.
    • (1981) IEEE Trans. Inform. Theory , vol.IT-27 , Issue.5 , pp. 533-547
    • Tanner, R.M.1
  • 4
    • 0033099611 scopus 로고    scopus 로고
    • Good error-correcting codes based on very sparse matrices
    • March
    • D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, no. 2, pp. 399-431, March 1999.
    • (1999) IEEE Trans. Inform. Theory , vol.45 , Issue.2 , pp. 399-431
    • MacKay, D.J.C.1
  • 5
    • 0035246320 scopus 로고    scopus 로고
    • Efficient encoding of low-density parity-check codes
    • February
    • T. Richardson and R. Urbanke, "Efficient encoding of low-density parity-check codes," IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 638-656, February 2001.
    • (2001) IEEE Transactions on Information Theory , vol.47 , Issue.2 , pp. 638-656
    • Richardson, T.1    Urbanke, R.2
  • 6
    • 0032001728 scopus 로고    scopus 로고
    • Turbo decoding as an instance of Pearl's "belief propagation" algorithm
    • February
    • R. J. McEliece, D. J. C. MacKay, and J.-F. Cheng, "Turbo decoding as an instance of Pearl's "belief propagation" algorithm," IEEE J. Selected Areas Commun., vol. 16, no. 2, pp. 140-152, February 1998.
    • (1998) IEEE J. Selected Areas Commun. , vol.16 , Issue.2 , pp. 140-152
    • McEliece, R.J.1    MacKay, D.J.C.2    Cheng, J.-F.3
  • 8
    • 0000199830 scopus 로고    scopus 로고
    • Evaluation of gallager codes for short block length and high rate applications
    • B. Marcus and J. Rosenthal, Eds. Springer-Verlag, New York
    • D. J. C. MacKay and M. C. Davey, "Evaluation of Gallager codes for short block length and high rate applications," in Codes, Systems and Graphical Models; volume 123 of IMA Volumes in Mathematics and its Applications;, B. Marcus and J. Rosenthal, Eds., pp. 113-130. Springer-Verlag, New York, 2000, available from (http://wol.ra.phy.cam.ac.uk/mackay/CodesRegular.html).
    • (2000) Codes, Systems and Graphical Models; Volume 123 of IMA Volumes in Mathematics and Its Applications , pp. 113-130
    • MacKay, D.J.C.1    Davey, M.C.2
  • 10
    • 0034206426 scopus 로고    scopus 로고
    • Iterative decoding of one-step majority logic decodable codes based on belief propagation
    • June
    • R. Lucas, M. P. C. Fossorier, Y. Kou, and S. Lin, "Iterative decoding of one-step majority logic decodable codes based on belief propagation," IEEE Trans. Commun., vol. 48, no. 6, pp. 931-937, June 2000.
    • (2000) IEEE Trans. Commun. , vol.48 , Issue.6 , pp. 931-937
    • Lucas, R.1    Fossorier, M.P.C.2    Kou, Y.3    Lin, S.4
  • 11
    • 0015432624 scopus 로고
    • On the number of information symbols in polynomial codes
    • November
    • S. Lin, "On the number of information symbols in polynomial codes," IEEE Trans. Inform. Theory, vol. IEEE Trans. Inform. Theory, no. IT-18, pp. 785-794, November 1972.
    • (1972) IEEE Trans. Inform. Theory, Vol. IEEE Trans. Inform. Theory , vol.IT-18 , pp. 785-794
    • Lin, S.1
  • 14
    • 0001006834 scopus 로고    scopus 로고
    • The resolution of the anti-pasch conjecture
    • July
    • M. J. Grannell, T. S. Griggs, and C. A. Whitehead, "The resolution of the anti-Pasch conjecture," J. Combin. Designs, vol. 8, no. 4, pp. 300309, July 2000.
    • (2000) J. Combin. Designs , vol.8 , Issue.4 , pp. 300309
    • Grannell, M.J.1    Griggs, T.S.2    Whitehead, C.A.3
  • 15
    • 84938933898 scopus 로고    scopus 로고
    • D. J. MacKay," http://wol.ra.phy.cam.ac.uk/mackay/.
    • MacKay, D.J.1


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