메뉴 건너뛰기




Volumn , Issue , 2010, Pages

Structured LDPC codes from permutation matrices free of small trapping sets

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIVE WHITE GAUSSIAN NOISE CHANNEL; BINARY SYMMETRIC CHANNEL; ERROR PERFORMANCE; FINITE FIELDS; ITERATIVE DECODING ALGORITHM; LATIN SQUARE; LDPC CODES; LOW-DENSITY PARITY-CHECK CODES; MATRIX OPERATIONS; PARITY CHECK MATRICES; PERMUTATION MATRIX; SUBGRAPHS; TANNER GRAPHS; TRAPPING SETS;

EID: 80051953637     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIG.2010.5592767     Document Type: Conference Paper
Times cited : (22)

References (20)
  • 4
    • 34547915644 scopus 로고    scopus 로고
    • Quasi-cyclic low-density parity-check codes with girth larger than 12
    • DOI 10.1109/TIT.2007.901193
    • S. Kim, J.-S. No, H. Chung, and D.-J. Shin, "Quasi-cyclic low-density parity-check codes with girth larger than 12," IEEE Int. Symp. Inf. Theory, vol. 53, no. 8, pp. 2885-2891, Aug. 2007. (Pubitemid 47260266)
    • (2007) IEEE Transactions on Information Theory , vol.53 , Issue.8 , pp. 2885-2891
    • Kim, S.1    No, J.-S.2    Chung, H.3    Shin, D.-J.4
  • 7
    • 42549151620 scopus 로고    scopus 로고
    • Error floors of LDPC codes on the binary symmetric channel
    • DOI 10.1109/ICC.2006.254892, 4024284, 2006 IEEE International Conference on Communications, ICC 2006
    • S. K. Chilappagari, S. Sankaranarayanan, and B. Vasic, "Error floors of LDPC codes on the binary symmetric channel," in Proc. Int. Conf. on Commun., vol. 3, 2006, pp. 1089-1094. (Pubitemid 351575455)
    • (2006) IEEE International Conference on Communications , vol.3 , pp. 1089-1094
    • Chilappagari, S.K.1    Sankaranarayanan, S.2    Vasic, B.3
  • 8
    • 84055222321 scopus 로고    scopus 로고
    • Instanton-based techniques for analysis and reduction of error floors of LDPC codes
    • Aug.
    • S. K. Chilappagari, M. Chertkov, M. G. Stepanov, and B. Vasic, "Instanton-based techniques for analysis and reduction of error floors of LDPC codes," IEEE JSAC on Capacity Approaching Codes, vol. 27, no. 6, pp. 855-865, Aug. 2009.
    • (2009) IEEE JSAC on Capacity Approaching Codes , vol.27 , Issue.6 , pp. 855-865
    • Chilappagari, S.K.1    Chertkov, M.2    Stepanov, M.G.3    Vasic, B.4
  • 9
    • 34447515759 scopus 로고    scopus 로고
    • Construction of quasi-cyclic LDPC codes for AWGN and binary erasure channels: A finite field approach
    • DOI 10.1109/TIT.2007.899516
    • L. Lan, L. Zeng, Y. Tai, L. Chen, S. Lin, and K. Abdel-Ghaffar, "Construction of quasi-cyclic LDPC codes for AWGN and binary erasure channels: a finite field approach," IEEE Trans. Inf. Theory, vol. 53, no. 7, pp. 2429-2458, Jul. 2007. (Pubitemid 47064280)
    • (2007) IEEE Transactions on Information Theory , vol.53 , Issue.7 , pp. 2429-2458
    • Lan, L.1    Zeng, L.2    Tai, Y.Y.3    Chen, L.4    Lin, S.5    Abdel-Ghaffar, K.6
  • 12
    • 0042092025 scopus 로고    scopus 로고
    • A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols
    • Jul.
    • I. Djurdjevic, J. Xu, K. Abdel-Ghaffar, and S. Lin, "A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols," IEEE Commun. Lett., vol. 7, no. 7, pp. 317-319, Jul. 2003.
    • (2003) IEEE Commun. Lett. , vol.7 , Issue.7 , pp. 317-319
    • Djurdjevic, I.1    Xu, J.2    Abdel-Ghaffar, K.3    Lin, S.4
  • 13
    • 3543037365 scopus 로고    scopus 로고
    • Near-Shannon-limit quasi-cyclic low-density parity-check codes
    • Jul.
    • L. Chen, J. Xu, I. Djurdjevic, and S. Lin, "Near-Shannon-limit quasi-cyclic low-density parity-check codes," IEEE Trans. Commun., vol. 52, no. 7, pp. 1038-1042, Jul. 2004.
    • (2004) IEEE Trans. Commun. , vol.52 , Issue.7 , pp. 1038-1042
    • Chen, L.1    Xu, J.2    Djurdjevic, I.3    Lin, S.4
  • 14
    • 0035504019 scopus 로고    scopus 로고
    • Low-density parity-check codes based on finite geometries: A rediscovery and new results
    • DOI 10.1109/18.959255, PII S0018944801085881
    • Y. Kou, S. Lin, and M. Fossorier, "Low-density parity-check codes based on finite geometries: a rediscovery and new results," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001. (Pubitemid 33053478)
    • (2001) IEEE Transactions on Information Theory , vol.47 , Issue.7 , pp. 2711-2736
    • Kou, Y.1    Lin, S.2    Fossorier, M.P.C.3
  • 15
    • 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
  • 17
    • 76649098590 scopus 로고    scopus 로고
    • Dinitz, Handbook of combinatorial designs, second edition (Discrete mathematics and its applications)
    • Chapman & Hall/
    • C. J. Colbourn and J. H. Dinitz, Handbook of combinatorial designs, second edition (Discrete mathematics and its applications). Chapman & Hall/CRC, 2006.
    • (2006) CRC
    • Colbourn, C.J.1
  • 18
    • 4444307239 scopus 로고    scopus 로고
    • High-rate girth-eight low-density parity-check codes on rectangular integer lattices
    • Aug.
    • B. Vasic, K. Pedagani, and M. Ivkovic, "High-rate girth-eight low-density parity-check codes on rectangular integer lattices," IEEE Trans. Commun, vol. 52, no. 8, pp. 1248-1252, Aug. 2004.
    • (2004) IEEE Trans. Commun , vol.52 , Issue.8 , pp. 1248-1252
    • Vasic, B.1    Pedagani, K.2    Ivkovic, M.3
  • 19
    • 39049138902 scopus 로고    scopus 로고
    • Generalized construction of quasi-cyclic regular LDPC codes based on permutation matrices
    • DOI 10.1109/ISIT.2006.261871, 4036049, Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
    • E. Gabidulin, A. Moinian, and B. Honary, "Generalized construction of quasi-cyclic regular LDPC codes based on permutation matrices," in Proc. IEEE Int. Symp. Inf. Theory, Jul. 2006, pp. 679-683. (Pubitemid 351244180)
    • (2006) IEEE International Symposium on Information Theory - Proceedings , pp. 679-683
    • Gabidulin, E.1    Moinian, A.2    Honary, B.3
  • 20
    • 12544253129 scopus 로고    scopus 로고
    • Regular and irregular progressive edge-growth tanner graphs
    • DOI 10.1109/TIT.2004.839541
    • X. Y. Hu, E. Eleftheriou, and D. M. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 386-398, Jan. 2005. (Pubitemid 40151893)
    • (2005) IEEE Transactions on Information Theory , vol.51 , Issue.1 , pp. 386-398
    • Hu, X.-Y.1    Eleftheriou, E.2    Arnold, D.M.3


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