메뉴 건너뛰기




Volumn , Issue , 2006, Pages 93-97

Design of non binary LDPC codes using their binary image: Algebraic properties

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC PROPERTIES; BINARY IMAGE; STOPPING SETS; TANNER GRAPH;

EID: 39049085820     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.261681     Document Type: Conference Paper
Times cited : (24)

References (21)
  • 2
    • 0027555114 scopus 로고
    • An Updated Table of Minimum-Distance for Binary Linear Codes
    • March
    • A.E. Brouwer and T. Verhoeff, "An Updated Table of Minimum-Distance for Binary Linear Codes", IEEE Trans.on Inf. Theory, Vol. 39, No. 2, pp. 662-677, March 1993.
    • (1993) IEEE Trans.on Inf. Theory , vol.39 , Issue.2 , pp. 662-677
    • Brouwer, A.E.1    Verhoeff, T.2
  • 3
    • 0035246128 scopus 로고    scopus 로고
    • Analysis of Sum-Product Decoding of Low-Density-Parity-Check Codes using a Gaussian Approximation
    • February
    • S.-Y. Chung, T. J. Richsardson, R.L. Urbanke, "Analysis of Sum-Product Decoding of Low-Density-Parity-Check Codes using a Gaussian Approximation", IEEE Trans. on Inf. Theory, Vol. 47, pp. 657-670, February 2001.
    • (2001) IEEE Trans. on Inf. Theory , vol.47 , pp. 657-670
    • Chung, S.-Y.1    Richsardson, T.J.2    Urbanke, R.L.3
  • 5
    • 0032099205 scopus 로고    scopus 로고
    • Low-Density Parity-Check Codes over GF(g)
    • June
    • M.C. Davey and D. MacKay, "Low-Density Parity-Check Codes over GF(g)", 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
  • 7
    • 0036612281 scopus 로고    scopus 로고
    • Finite-length Analysis of Low-Density Parity-Check Codes on the Binary Erasure Channel
    • June
    • C. Di,D. Proietti, I.E. Telatar, T.J. Richardson, R.L. Urbanke, "Finite-length Analysis of Low-Density Parity-Check Codes on the Binary Erasure Channel", IEEE Trans. on Inf. Theory, Vol. 48, No. 6, pp. 1570-1579, June 2002.
    • (2002) IEEE Trans. on Inf. Theory , vol.48 , Issue.6 , pp. 1570-1579
    • Di, C.1    Proietti, D.2    Telatar, I.E.3    Richardson, T.J.4    Urbanke, R.L.5
  • 9
    • 4143058324 scopus 로고    scopus 로고
    • On the Computation of the Minimum Distance of Low-Density Parity-Check Codes
    • Paris, France, June
    • X.Y. Hu and M. Fossorier, "On the Computation of the Minimum Distance of Low-Density Parity-Check Codes," IEEE Int. Conf. on Commun., Paris, France, June 2004.
    • (2004) IEEE Int. Conf. on Commun
    • Hu, X.Y.1    Fossorier, M.2
  • 11
    • 5044246916 scopus 로고    scopus 로고
    • Approximate Algorithms for Computating the Minimum Distance of Low-Density Parity-Check Codes
    • Chicago, USA, June
    • X.Y. Hu, M. Fossorier and E. Eleftheriou, "Approximate Algorithms for Computating the Minimum Distance of Low-Density Parity-Check Codes", IEEE Int. Symp. on Inf. Theory, Chicago, USA, June 2004.
    • (2004) IEEE Int. Symp. on Inf. Theory
    • Hu, X.Y.1    Fossorier, M.2    Eleftheriou, E.3
  • 12
    • 12544253129 scopus 로고    scopus 로고
    • Regular and Irregular Progressive Edge-Growth Tanner Graphs
    • January
    • X.-Y. Hu, E. Eleftheriou and D.M. Arnold, "Regular and Irregular Progressive Edge-Growth Tanner Graphs", IEEE Trans. on Inf. Theory, Vol. 51, No. 1, pp. 386-398, January 2005.
    • (2005) IEEE Trans. on Inf. Theory , vol.51 , Issue.1 , pp. 386-398
    • Hu, X.-Y.1    Eleftheriou, E.2    Arnold, D.M.3
  • 14
    • 0033099611 scopus 로고    scopus 로고
    • Good Codes Based on Very Sparse Matrix
    • D. Mackay, "Good Codes Based on Very Sparse Matrix", IEEE Trans. On Commun., Vol. 45, No. 2, pp 399-431, 1999.
    • (1999) IEEE Trans. On Commun , vol.45 , Issue.2 , pp. 399-431
    • Mackay, D.1
  • 17
    • 35449007405 scopus 로고    scopus 로고
    • Optimization of non binary LDPC codes using their binary images
    • Munich, Germany, April
    • C. Poulliat, M. Fossorier, D. Declercq, "Optimization of non binary LDPC codes using their binary images", in Proc. Int. Turbo Code Symposium, Munich, Germany, April 2006.
    • (2006) Proc. Int. Turbo Code Symposium
    • Poulliat, C.1    Fossorier, M.2    Declercq, D.3
  • 19
    • 0035246127 scopus 로고    scopus 로고
    • Design of Capacity Approching Irregular Low-Density Parity-Check Codes
    • Feb
    • T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of Capacity Approching Irregular Low-Density Parity-Check Codes", IEEE Trans. on Inf. Theory, Vol. 47, pp.657-670, Feb. 2001.
    • (2001) IEEE Trans. on Inf. Theory , vol.47 , pp. 657-670
    • Richardson, T.1    Shokrollahi, A.2    Urbanke, R.3
  • 20
    • 4444318644 scopus 로고    scopus 로고
    • Selective Avoidance of Cycles in Irregular LDPC Code Construction
    • Aug
    • T. Tian, C.R. Jones, J.D. Villasenor, R.D. Wesel, "Selective Avoidance of Cycles in Irregular LDPC Code Construction", IEEE Trans. on Commun., Vol. 52, No. 8, pp. 1242-1247, Aug. 2004.
    • (2004) IEEE Trans. on Commun , vol.52 , Issue.8 , pp. 1242-1247
    • Tian, T.1    Jones, C.R.2    Villasenor, J.D.3    Wesel, R.D.4
  • 21
    • 33846605096 scopus 로고    scopus 로고
    • Dispersive Reed-Solomon Codes for Iterative Decoding and Construction of q-ary LDPC Codes
    • St. Louis, USA, Nov.-Dec
    • L. Zeng, L. Lan, Y.Y. Tai and S. Lin, "Dispersive Reed-Solomon Codes for Iterative Decoding and Construction of q-ary LDPC Codes," Proc. IEEE Globecom'05, St. Louis, USA, Nov.-Dec. 2005.
    • (2005) Proc. IEEE Globecom'05
    • Zeng, L.1    Lan, L.2    Tai, Y.Y.3    Lin, S.4


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