메뉴 건너뛰기




Volumn 53, Issue 8, 2007, Pages 2885-2891

Quasi-cyclic low-density parity-check codes with girth larger than 12

Author keywords

Girth; Low density parity check (LDPC) codes; Protograph; Protograph codes; Quasi cyclic (QC) codes

Indexed keywords

DATA COMMUNICATION SYSTEMS; IMAGE COMPRESSION; IMAGE RECONSTRUCTION; MATRIX ALGEBRA; PATTERN MATCHING; PHOTOGRAPHY;

EID: 34547915644     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2007.901193     Document Type: Article
Times cited : (93)

References (13)
  • 1
    • 3943064364 scopus 로고    scopus 로고
    • Quasicyclic low-density parity-check codes from circulant permutation matrices
    • Aug
    • M. Fossorier, "Quasicyclic low-density parity-check codes from circulant permutation matrices," IEEE Trans. Inf. Theory, vol. 50, no. 8, pp. 1788-1793, Aug. 2004.
    • (2004) IEEE Trans. Inf. Theory , vol.50 , Issue.8 , pp. 1788-1793
    • Fossorier, M.1
  • 3
    • 18144396564 scopus 로고    scopus 로고
    • Block-LDPC: A practical LDPC coding system design approach
    • Apr
    • H. Zhong and T. Zhang, "Block-LDPC: A practical LDPC coding system design approach," IEEE Trans. Circuits Syst., vol. 52, no. 4, p. 766-775, Apr. 2005.
    • (2005) IEEE Trans. Circuits Syst , vol.52 , Issue.4 , pp. 766-775
    • Zhong, H.1    Zhang, T.2
  • 4
    • 2942659753 scopus 로고    scopus 로고
    • Combinatorial constructions of low-density parity-check codes for iterative decoding
    • Jun
    • B. Vasic and O. Milenkovic, "Combinatorial constructions of low-density parity-check codes for iterative decoding," IEEE Trans. Inf. Theory vol. 50, no. 6, pp. 1156-1176, Jun. 2004.
    • (2004) IEEE Trans. Inf. Theory , vol.50 , Issue.6 , pp. 1156-1176
    • Vasic, B.1    Milenkovic, O.2
  • 5
    • 2942661950 scopus 로고    scopus 로고
    • Construction of low-density parity-check codes based on balanced incomplete block designs
    • Jun
    • B. Ammar, B. Honary, Y. Kou, J. Xu, and S. Lin, "Construction of low-density parity-check codes based on balanced incomplete block designs," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1257-1268, Jun. 2004.
    • (2004) IEEE Trans. Inf. Theory , vol.50 , Issue.6 , pp. 1257-1268
    • Ammar, B.1    Honary, B.2    Kou, Y.3    Xu, J.4    Lin, S.5
  • 6
    • 23844550376 scopus 로고    scopus 로고
    • Quasicyclic LDPC codes for fast encoding
    • Aug
    • S. Myung, K. Yang, and J. Kim, "Quasicyclic LDPC codes for fast encoding," IEEE Trans. Inf. Theory, vol. 51, no. 8, pp. 2894-2901, Aug. 2005.
    • (2005) IEEE Trans. Inf. Theory , vol.51 , Issue.8 , pp. 2894-2901
    • Myung, S.1    Yang, K.2    Kim, J.3
  • 8
    • 5044252858 scopus 로고    scopus 로고
    • Methodologies for designing LDPC codes using protographs and circulants
    • J. Thorpe, K. Andrews, and S. Dolinar, "Methodologies for designing LDPC codes using protographs and circulants," in Proc. Int. Symp. Inf. Theory, 2004, p. 236.
    • (2004) Proc. Int. Symp. Inf. Theory , pp. 236
    • Thorpe, J.1    Andrews, K.2    Dolinar, S.3
  • 9
    • 21444446196 scopus 로고    scopus 로고
    • Flexible construction of irregular partitioned permutation LDPC codes with low error floors
    • Jun
    • J. Kang, P. Fan, and Z. Cao, "Flexible construction of irregular partitioned permutation LDPC codes with low error floors," IEEE Commun. Lett., vol. 9, no. 6, pp. 534-536, Jun. 2005.
    • (2005) IEEE Commun. Lett , vol.9 , Issue.6 , pp. 534-536
    • Kang, J.1    Fan, P.2    Cao, Z.3
  • 10
    • 33645725165 scopus 로고    scopus 로고
    • On the girth of Tanner's (3, 5) quasi-cyclic LDPC codes
    • Apr
    • S. Kim, J.-S. No, H. Chung, and D.-J. Shin, "On the girth of Tanner's (3, 5) quasi-cyclic LDPC codes," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1739-1744, Apr. 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.52 , Issue.4 , pp. 1739-1744
    • Kim, S.1    No, J.-S.2    Chung, H.3    Shin, D.-J.4
  • 13
    • 84938915656 scopus 로고    scopus 로고
    • Regular low-density parity-check codes from combinatorial designs
    • S. J. Johnson and S. R. Weller, "Regular low-density parity-check codes from combinatorial designs," in Proc. Information Theory Workshop 2001, pp. 90-92.
    • (2001) Proc. Information Theory Workshop , pp. 90-92
    • Johnson, S.J.1    Weller, S.R.2


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