메뉴 건너뛰기




Volumn 1, Issue , 2005, Pages 630-635

Algorithmic and combinatorial analysis of trapping sets in structured LDPC codes

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL ANALYSIS; LOW DENSITY PARITY CHECK (LDPC) CODES; MARGULIS CODE; TRAPPING SETS;

EID: 33846072228     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WIRLES.2005.1549481     Document Type: Conference Paper
Times cited : (99)

References (11)
  • 4
    • 0035504019 scopus 로고    scopus 로고
    • Low-density parity-check codes based on finite geometries: A rediscovery and new results
    • Nov.
    • Y. Kou, S. Lin and M.P.C. Fossorier, "Low-density parity-check codes based on finite geometries: a rediscovery and new results," IEEE Trans. Inform. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , Issue.7 , pp. 2711-2736
    • Kou, Y.1    Lin, S.2    Fossorier, M.P.C.3
  • 7
    • 23844506274 scopus 로고    scopus 로고
    • Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes
    • D.J.C. MacKay, and M.S. Postol, "Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes," Electronic Notes in Theoretical Computer Science, Vol. 74, 2003, URL: http://www.elsevier.nl/locate/ entcs/volume74.html.
    • (2003) Electronic Notes in Theoretical Computer Science , vol.74
    • MacKay, D.J.C.1    Postol, M.S.2
  • 9
    • 0034857480 scopus 로고    scopus 로고
    • Constructions of regular and irregular LDPC codes using Ramanujan graphs and ideas from Margulis
    • Washington D.C., June 24-29
    • J. Rosenthal and P.O. Vontobel, "Constructions of regular and irregular LDPC codes using Ramanujan graphs and ideas from Margulis," Proc. Int. Symp. Inform. Theory (ISIT'01), Washington D.C., p. 4, June 24-29, 2001.
    • (2001) Proc. Int. Symp. Inform. Theory (ISIT'01) , pp. 4
    • Rosenthal, J.1    Vontobel, P.O.2


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