메뉴 건너뛰기




Volumn , Issue , 2009, Pages 462-466

Structured high-girth non-binary cycle codes

Author keywords

[No Author keywords available]

Indexed keywords

CYCLE CODES; DESCRIPTION COMPLEXITY; ERROR PROPERTIES; HAMILTONIAN CYCLE; HAMILTONIAN GRAPH; HIGH SIGNAL-TO-NOISE RATIO; LOW COMPLEXITY; NON-BINARY; SIMULATION RESULT;

EID: 77949431660     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/APCC.2009.5375593     Document Type: Conference Paper
Times cited : (8)

References (23)
  • 2
    • 0030219216 scopus 로고    scopus 로고
    • Near Shannon limit performance of low density parity check codes
    • Aug
    • D. J. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," IEE Electron. Lett., vol. 32, no. 18, pp. 1645-1646, Aug. 1996.
    • (1996) IEE Electron. Lett , vol.32 , Issue.18 , pp. 1645-1646
    • MacKay, D.J.1    Neal, R.M.2
  • 6
    • 4444350397 scopus 로고    scopus 로고
    • Large girth cycle codes for partial response channels
    • July
    • H. Song, J. Liu, and B. V. K. Vijaya Kumar, "Large girth cycle codes for partial response channels," IEEE Trans. Magn., vol. 40, no. 4, part 2, pp. 3084-3086, July 2004.
    • (2004) IEEE Trans. Magn , vol.40 , Issue.4 PART 2 , pp. 3084-3086
    • Song, H.1    Liu, J.2    Vijaya Kumar, B.V.K.3
  • 7
    • 0842310780 scopus 로고    scopus 로고
    • The design of structured regular LDPC codes with large girth
    • San Francisco, Calif, USA, Dec
    • H. Zhang and J. Moura, "The design of structured regular LDPC codes with large girth," in Proc. of IEEE Global Telecommunications Conference, San Francisco, Calif., USA, Dec. 2003, vol. 7, pp. 4022-4027.
    • (2003) Proc. of IEEE Global Telecommunications Conference , vol.7 , pp. 4022-4027
    • Zhang, H.1    Moura, J.2
  • 8
    • 0032099205 scopus 로고    scopus 로고
    • Low-density parity-check codes over GF(q)
    • June
    • M. C. Davey and D. MacKay, "Low-density parity-check codes over GF(q)", IEEE Commun. letters, vol. 2, pp. 165-167, June 1998.
    • (1998) IEEE Commun. letters , vol.2 , pp. 165-167
    • Davey, M.C.1    MacKay, D.2
  • 10
    • 54949083457 scopus 로고    scopus 로고
    • c)-LDPC codes over GF(q) using their binary images
    • October
    • c)-LDPC codes over GF(q) using their binary images", IEEE Trans. Commun., vol. 56, no. 10, pp. 1626-1635, October 2008.
    • (2008) IEEE Trans. Commun , vol.56 , Issue.10 , pp. 1626-1635
    • Poulliat, C.1    Fossorier, M.2    Declercq, D.3
  • 12
    • 0011363459 scopus 로고
    • Graph-theoretic error correcting codes
    • July
    • S. L. Hakimi and J. Bredeson, "Graph-theoretic error correcting codes," IEEE Trans. Inf. Theory, vol. IT-14, no. 4, pp. 584-591, July 1968.
    • (1968) IEEE Trans. Inf. Theory , vol.IT-14 , Issue.4 , pp. 584-591
    • Hakimi, S.L.1    Bredeson, J.2
  • 13
    • 0019608335 scopus 로고
    • A recursive approach to low-complexity codes
    • Sept
    • R. M. Tanner, "A recursive approach to low-complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 533-547, Sept. 1981.
    • (1981) IEEE Trans. Inf. Theory , vol.IT-27 , Issue.5 , pp. 533-547
    • Tanner, R.M.1
  • 14
    • 33947113313 scopus 로고    scopus 로고
    • High girth column-weight-two LDPC codes based on distance graphs
    • ID 48158, pp, doi:10.1155/2007/48158
    • G. Malema and M. Liebelt, "High girth column-weight-two LDPC codes based on distance graphs," EURASIP Journal on Wireless Communications and Networking, vol. 2007, ID 48158, pp. 1-5, 2007. doi:10.1155/2007/48158.
    • (2007) EURASIP Journal on Wireless Communications and Networking , vol.2007 , pp. 1-5
    • Malema, G.1    Liebelt, M.2
  • 16
    • 0347648447 scopus 로고    scopus 로고
    • A trivalent graph of girth 17
    • Sept
    • G. Exoo, "A trivalent graph of girth 17," Australasian Journal of Combinatorics, vol. 24, pp. 261-264, Sept. 2001.
    • (2001) Australasian Journal of Combinatorics , vol.24 , pp. 261-264
    • Exoo, G.1
  • 18
    • 58149527911 scopus 로고    scopus 로고
    • Design of cages with a randomized progressive edge-growth algorithm
    • April
    • A. Venkiah, D. Declercq and C. Poulliat, "Design of cages with a randomized progressive edge-growth algorithm," IEEE Commun. Lett., vol. 12, no. 4, pp. 1-3, April 2008.
    • (2008) IEEE Commun. Lett , vol.12 , Issue.4 , pp. 1-3
    • Venkiah, A.1    Declercq, D.2    Poulliat, C.3
  • 20
    • 33744467712 scopus 로고    scopus 로고
    • p) codes through graph analysis
    • May
    • p) codes through graph analysis," IEEE Commun. Lett., vol. 10, pp. 369-371, May 2006.
    • (2006) IEEE Commun. Lett , vol.10 , pp. 369-371
    • Huang, J.1    Zhu, J.2
  • 21
    • 57049117441 scopus 로고    scopus 로고
    • Nonbinary LDPC coding for multicarrier underwater acoustic communication
    • Dec
    • J. Huang, S. Zhou, and P. Willett, "Nonbinary LDPC coding for multicarrier underwater acoustic communication," IEEE J. Sel. Areas Commun., vol. 26, no. 9, pp. 1684-1696, Dec. 2008
    • (2008) IEEE J. Sel. Areas Commun , vol.26 , Issue.9 , pp. 1684-1696
    • Huang, J.1    Zhou, S.2    Willett, P.3
  • 22
    • 77949444821 scopus 로고    scopus 로고
    • IEEE 802.16-2004, IEEE standard for local and metropolitan area networks, air interface for fixed broadband wireless access systems, October 2004.
    • IEEE 802.16-2004, "IEEE standard for local and metropolitan area networks, air interface for fixed broadband wireless access systems," October 2004.
  • 23
    • 23844506274 scopus 로고    scopus 로고
    • Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes
    • D. MacKay, M. Postol, "Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes," Electronic Notes in Theoretical Computer Science, 2003, vol 74, pp. 1-8.
    • (2003) Electronic Notes in Theoretical Computer Science , vol.74 , pp. 1-8
    • MacKay, D.1    Postol, M.2


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