메뉴 건너뛰기




Volumn 49, Issue 12, 2003, Pages 3268-3271+3356

On the Minimum Distance of Array Codes as LDPC Codes

Author keywords

Array codes; Low density parity check (LDPC) codes; Minimum distance

Indexed keywords

BINARY CODES; DECODING; ITERATIVE METHODS; MATRIX ALGEBRA; PROBLEM SOLVING; SEARCH ENGINES;

EID: 0346707318     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2003.820053     Document Type: Article
Times cited : (80)

References (9)
  • 1
    • 0027307914 scopus 로고
    • New array codes for multiple phased burst correction
    • Jan.
    • M. Blaum and R. M. Roth, "New array codes for multiple phased burst correction," IEEE Trans. Inform. Theory, vol. 39, pp. 66-77, Jan. 1993.
    • (1993) IEEE Trans. Inform. Theory , vol.39 , pp. 66-77
    • Blaum, M.1    Roth, R.M.2
  • 2
    • 84925405668 scopus 로고
    • Low-density parity-check codes
    • Jan.
    • R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inform. Theory, vol. IT-8, pp. 21-28, Jan. 1962.
    • (1962) IRE Trans. Inform. Theory , vol.IT-8 , pp. 21-28
    • Gallager, R.G.1
  • 3
    • 0001813506 scopus 로고    scopus 로고
    • Array codes as low-desity parity-check codes
    • Brest, France, Sept. 4-7
    • J. L. Fan, "Array codes as low-desity parity-check codes," in Proc. 2nd Int. Symp. Turbo Codes, Brest, France, Sept. 4-7, 2000, pp. 543-546.
    • (2000) Proc. 2nd Int. Symp. Turbo Codes , pp. 543-546
    • Fan, J.L.1
  • 5
    • 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," Electron. Lett., vol. 32, pp. 1645-1646, Aug. 1996.
    • (1996) Electron. Lett. , vol.32 , pp. 1645-1646
    • MacKay, D.J.C.1    Neal, R.M.2
  • 6
    • 0036351583 scopus 로고    scopus 로고
    • Efficient encoding and minimum distance bounds of Reed-Solomon-type array codes
    • Lausanne, Switzerland, June/July
    • T. Mittelholzer, "Efficient encoding and minimum distance bounds of Reed-Solomon-type array codes," in Proc. 2002 IEEE Int. Symp. Information Theory (ISIT 2002), Lausanne, Switzerland, June/July 2002, p. 282.
    • (2002) Proc. 2002 IEEE Int. Symp. Information Theory (ISIT 2002) , pp. 282
    • Mittelholzer, T.1
  • 7
    • 0035246127 scopus 로고    scopus 로고
    • Design of capacity-approaching irregular low-density parity check codes
    • Feb.
    • T. J. Richardson, M. A. Shokrollahi, and R. L. 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.L.3
  • 8
    • 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
  • 9
    • 0035246312 scopus 로고    scopus 로고
    • Minimum-distance bounds by graph analysis
    • Feb.
    • _, "Minimum-distance bounds by graph analysis," IEEE Trans. Inform. Theory, vol. 47, pp. 808-821, Feb. 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , pp. 808-821


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