메뉴 건너뛰기




Volumn , Issue , 2007, Pages 2946-2950

Stopping-set enumerator approximations for finite-length protograph LDPC codes

Author keywords

[No Author keywords available]

Indexed keywords

STOPPING SETS;

EID: 51649094553     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2007.4557666     Document Type: Conference Paper
Times cited : (6)

References (10)
  • 1
    • 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. Information Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
    • (2001) IEEE Trans. Information Theory , vol.47 , Issue.2 , pp. 619-637
    • Richardson, T.J.1    Shokrollahi, M.A.2    Urbanke, R.L.3
  • 2
    • 0036612281 scopus 로고    scopus 로고
    • Finite-length analysis of low-density parity-check codes on the binary erasure channel
    • June
    • C. Di, D. Proietti, IE. Telatar, T.J. Richardson, and R.L. Urbanke, "Finite-length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Information Theory, vol. 48, no. 6, pp. 1570-1579, June 2002.
    • (2002) IEEE Trans. Information Theory , vol.48 , Issue.6 , pp. 1570-1579
    • Di, C.1    Proietti, D.2    Telatar, I.E.3    Richardson, T.J.4    Urbanke, R.L.5
  • 5
    • 33846590419 scopus 로고    scopus 로고
    • Low-density parity-check (LDPC) codes constructed from protographs,
    • 42-154, Aug. 15
    • J. Thorpe, "Low-density parity-check (LDPC) codes constructed from protographs," Interplanetary Network Progress Report 42-154, Aug. 15, 2003.
    • (2003) Interplanetary Network Progress Report
    • Thorpe, J.1
  • 7
    • 0041919281 scopus 로고    scopus 로고
    • The renaissance of Gaüager's low-density parity-check codes
    • Aug
    • T. Richardson and R. Urbanke, "The renaissance of Gaüager's low-density parity-check codes," IEEE Communications Mag., pp. 126-131, Aug. 2003.
    • (2003) IEEE Communications Mag , pp. 126-131
    • Richardson, T.1    Urbanke, R.2
  • 8
    • 84923637124 scopus 로고    scopus 로고
    • Modern coding theory, Cambridge University Press
    • In preparation
    • T. Richardson and R. Urbanke, Modern coding theory, Cambridge University Press, In preparation.
    • Richardson, T.1    Urbanke, R.2
  • 9
    • 84888044329 scopus 로고    scopus 로고
    • Stopping-set enumerator approximations for finite-length protograph LDPC codes
    • ∼anastas/docs/ isit0 7_fa_extended.pdf
    • ∼anastas/docs/ isit0 7_fa_extended.pdf, 2007.
    • (2007)
    • Fu, K.1    Anastasopoulos, A.2
  • 10
    • 50949122889 scopus 로고    scopus 로고
    • Protograph LDPC codes with node degrees at least 3
    • San Francisco, CA, Nov
    • D. Divsalar and C. Jones, "Protograph LDPC codes with node degrees at least 3," in Proc. Globecom Conf. San Francisco, CA, Nov. 2006.
    • (2006) Proc. Globecom Conf
    • Divsalar, D.1    Jones, C.2


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