메뉴 건너뛰기




Volumn 43, Issue 22, 2007, Pages 1220-1222

Structured non-binary LDPC codes with large girth

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; IMAGE CODING; ITERATIVE DECODING; PARAMETER ESTIMATION;

EID: 35448979822     PISSN: 00135194     EISSN: None     Source Type: Journal    
DOI: 10.1049/el:20072120     Document Type: Article
Times cited : (18)

References (10)
  • 1
    • 0032099205 scopus 로고    scopus 로고
    • Low-density parity check codes over GF(q)
    • 10.1109/4234.681360 1089-7798
    • Davey, M.C., and MacKay, D.: ' Low-density parity check codes over GF(q) ', IEEE Commun. Lett., 1998, 2, (6), p. 165-167 10.1109/4234.681360 1089-7798
    • (1998) IEEE Commun. Lett. , vol.2 , Issue.6 , pp. 165-167
    • Davey, M.C.1    MacKay, D.2
  • 2
    • 35448943296 scopus 로고    scopus 로고
    • 1999, PhD, University of Cambridge
    • Davey, M.C.: ' Error-correcting using low-density parity-check codes ', 1999, PhD, University of Cambridge
    • Davey, M.C.1
  • 3
    • 35449007405 scopus 로고    scopus 로고
    • Optimization of non binary LDPC codes using their binary images
    • Munich, Germany, April
    • Poulliat, C., Fossorier, M., and Declercq, D.: ' Optimization of non binary LDPC codes using their binary images ', Proc. Int. Turbo Code Symp., Munich, Germany, April, 2006
    • (2006) Proc. Int. Turbo Code Symp.
    • Poulliat, C.1    Fossorier, M.2    Declercq, D.3
  • 4
    • 33846605096 scopus 로고    scopus 로고
    • Dispersed Reed-Solomon codes for iterative decoding and construction of q-ary LDPC codes
    • St. Louis, USA, Dec.
    • Zeng, L., Lan, L., Tai, Y.Y., and Lin, S.: ' Dispersed Reed-Solomon codes for iterative decoding and construction of q-ary LDPC codes ', Proc. IEEE Globecom Conf., St. Louis, USA, Dec., 2005, 3, p. 1193-1198
    • (2005) Proc. IEEE Globecom Conf. , vol.3 , pp. 1193-1198
    • Zeng, L.1    Lan, L.2    Tai, Y.Y.3    Lin, S.4
  • 6
    • 12544253129 scopus 로고    scopus 로고
    • Regular and irregular progressive edge-growth Tanner graphs
    • 10.1109/TIT.2004.839541 0018-9448
    • Hu, X.-Y., Eleftheriou, E., and Arnold, D.M.: ' Regular and irregular progressive edge-growth Tanner graphs ', IEEE Trans. Inf. Theory, 2005, 51, (1), p. 386-398 10.1109/TIT.2004.839541 0018-9448
    • (2005) IEEE Trans. Inf. Theory , vol.51 , Issue.1 , pp. 386-398
    • Hu, X.-Y.1    Eleftheriou, E.2    Arnold, D.M.3
  • 7
    • 3943064364 scopus 로고    scopus 로고
    • Quasi-cyclic low-density parity-check codes from circulant permutation matrices
    • 10.1109/TIT.2004.831841 0018-9448
    • Fossorier, M.: ' Quasi-cyclic low-density parity-check codes from circulant permutation matrices ', IEEE Trans. Inf. Theory, 2004, 50, (8), p. 1788-1793 10.1109/TIT.2004.831841 0018-9448
    • (2004) IEEE Trans. Inf. Theory , vol.50 , Issue.8 , pp. 1788-1793
    • Fossorier, M.1
  • 8
    • 33746623367 scopus 로고    scopus 로고
    • Shortened array codes of large girth
    • 10.1109/TIT.2006.878179 0018-9448
    • Milenkovic, O., Kashyap, N., and Leyba, D.: ' Shortened array codes of large girth ', IEEE Trans. Inf. Theory, 2006, 52, (8), p. 3707-3722 10.1109/TIT.2006.878179 0018-9448
    • (2006) IEEE Trans. Inf. Theory , vol.52 , Issue.8 , pp. 3707-3722
    • Milenkovic, O.1    Kashyap, N.2    Leyba, D.3
  • 9
    • 35448946222 scopus 로고    scopus 로고
    • The On-Line Encyclopedia of Integer Sequences, from N.J.A. Sloane's website, available at http://www.research.att.com/~njas/sequences/A025582
    • The On-Line Encyclopedia of Integer Sequences, from N.J.A. Sloane's website, available at http://www.research.att.com/~njas/sequences/A025582
  • 10
    • 34247209021 scopus 로고    scopus 로고
    • Decoding algorithms for nonbinary LDPC codes over GF(q)
    • 10.1109/TCOMM.2007.894088 0090-6778
    • Declercq, D., and Fossorier, M.: ' Decoding algorithms for nonbinary LDPC codes over GF(q) ', IEEE Trans. Commun., 2007, 55, (4), p. 633-643 10.1109/TCOMM.2007.894088 0090-6778
    • (2007) IEEE Trans. Commun. , vol.55 , Issue.4 , pp. 633-643
    • Declercq, D.1    Fossorier, M.2


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