메뉴 건너뛰기




Volumn , Issue , 2006, Pages 1554-1558

Ensemble weight enumerators for protograph LDPC codes

Author keywords

[No Author keywords available]

Indexed keywords

LDPC CODES; LINEAR MINIMUM DISTANCE; PROTOGRAPH STRUCTURES;

EID: 34247182383     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.262129     Document Type: Conference Paper
Times cited : (61)

References (21)
  • 3
    • 33846590419 scopus 로고    scopus 로고
    • Low Density Parity Check (LDPC) Codes Constructed from Protographs,
    • 42-154, August 15
    • Jeremy Thorpe, "Low Density Parity Check (LDPC) Codes Constructed from Protographs," JPL INP Progress Report 42-154, August 15, 2003.
    • (2003) JPL INP Progress Report
    • Thorpe, J.1
  • 4
    • 5044251189 scopus 로고    scopus 로고
    • Methods and apparatus for decoding LDPC codes,
    • United States Patent 6,633,856, October 14
    • Richardson, et al., "Methods and apparatus for decoding LDPC codes," United States Patent 6,633,856, October 14, 2003.
    • (2003)
    • Richardson1
  • 5
    • 24344446341 scopus 로고    scopus 로고
    • Multi-Edge Type LDPC Codes
    • presented at the, California Institute of Technology, Pasadena, California, May 24-25
    • T. Richardson, "Multi-Edge Type LDPC Codes," presented at the Workshop honoring Prof. Bob McEliece on his 60th birthday, California Institute of Technology, Pasadena, California, May 24-25, 2002.
    • (2002) Workshop honoring Prof. Bob McEliece on his 60th birthday
    • Richardson, T.1
  • 6
    • 0041919281 scopus 로고    scopus 로고
    • The Renaissance of Gallager's Low-Density Parity-Check Codes
    • August
    • T. Richardson and R. Urbanke,"The Renaissance of Gallager's Low-Density Parity-Check Codes," IEEE Communications Magazine, pages 126-131, August 2003
    • (2003) IEEE Communications Magazine , pp. 126-131
    • Richardson, T.1    Urbanke, R.2
  • 7
    • 0742321724 scopus 로고    scopus 로고
    • Upper Bounds to Error Probabilities of Coded Systems Beyond the Cutoff Rate
    • December
    • D. Divsalar, and E. Biglieri, "Upper Bounds to Error Probabilities of Coded Systems Beyond the Cutoff Rate," IEEE Trans. on Communications, vol. 51, No. 12, December 2003.
    • (2003) IEEE Trans. on Communications , vol.51 , Issue.12
    • Divsalar, D.1    Biglieri, E.2
  • 8
    • 0030106621 scopus 로고    scopus 로고
    • Unveiling Turbo Codes: Some results on parallel concatenated codes
    • March
    • S. Bennedetto and G. Montorsi, "Unveiling Turbo Codes: Some results on parallel concatenated codes," IEEE Trans. On Information Theory, vol. 42, no. 2, March 1996, pp. 409-428.
    • (1996) IEEE Trans. On Information Theory , vol.42 , Issue.2 , pp. 409-428
    • Bennedetto, S.1    Montorsi, G.2
  • 9
    • 0032072269 scopus 로고    scopus 로고
    • Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding
    • May
    • S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding," IEEE Trans. Info. Theory, vol. 44, pp. 909-926, May 1998.
    • (1998) IEEE Trans. Info. Theory , vol.44 , pp. 909-926
    • Benedetto, S.1    Divsalar, D.2    Montorsi, G.3    Pollara, F.4
  • 12
    • 5044248297 scopus 로고    scopus 로고
    • Ikegaya, R.; Kasai, K.; Shibuya, T.; Sakaniwa, K.; Asymptotic weight and stopping set distributions for detailedly represented irregular LDPC code ensembles, ISIT 2004. Proceedings. International Symposium on Information Theory, 2004. 27 June-2 July 2004 Page(s):208
    • Ikegaya, R.; Kasai, K.; Shibuya, T.; Sakaniwa, K.; Asymptotic weight and stopping set distributions for detailedly represented irregular LDPC code ensembles, ISIT 2004. Proceedings. International Symposium on Information Theory, 2004. 27 June-2 July 2004 Page(s):208
  • 13
    • 5044251764 scopus 로고    scopus 로고
    • Tillich, J.-P.; The average weight distribution of Tanner code ensembles and a way to modify them to improve their weight distribution, ISIT 2004. Proceedings. International Symposium on Information Theory, 2004. 27 June-2 July 2004 Page(s):7
    • Tillich, J.-P.; The average weight distribution of Tanner code ensembles and a way to modify them to improve their weight distribution, ISIT 2004. Proceedings. International Symposium on Information Theory, 2004. 27 June-2 July 2004 Page(s):7
  • 14
    • 0034850871 scopus 로고    scopus 로고
    • Changyan Di; Urbanke, R.; Richardson, T.; Weight distributions: how deviant can you be? Proceedings, 2001 IEEE International Symposium on Information Theory, 2001. 24-29 June 2001 Page(s):50
    • Changyan Di; Urbanke, R.; Richardson, T.; Weight distributions: how deviant can you be? Proceedings, 2001 IEEE International Symposium on Information Theory, 2001. 24-29 June 2001 Page(s):50
  • 15
    • 5044242131 scopus 로고    scopus 로고
    • Di, C.; Montanari, A.; Urbanke, R.; Weight distributions of LDPC code ensembles: combinatorics meets statistical physics , ISIT 2004. Proceedings. International Symposium on Information Theory, 2004. 27 June-2 July 2004 Page(s):102
    • Di, C.; Montanari, A.; Urbanke, R.; Weight distributions of LDPC code ensembles: combinatorics meets statistical physics , ISIT 2004. Proceedings. International Symposium on Information Theory, 2004. 27 June-2 July 2004 Page(s):102
  • 16
    • 2942679339 scopus 로고    scopus 로고
    • Asymptotic enumeration methods for analyzing LDPC codes
    • June Pages
    • Burshtein, D.; Miller, G.; Asymptotic enumeration methods for analyzing LDPC codes, IEEE Transactions on Information Theory, Volume 50, Issue 6, June 2004 Page(s):1115-1131
    • (2004) IEEE Transactions on Information Theory , vol.50 , Issue.6 , pp. 1115-1131
    • Burshtein, D.1    Miller, G.2
  • 17
    • 0347968063 scopus 로고    scopus 로고
    • Distance distributions in ensembles of irregular low-density parity-check codes
    • Dec, Pages
    • Litsyn, S.; Shevelev, V.; Distance distributions in ensembles of irregular low-density parity-check codes , IEEE Transactions on Information Theory, Volume 49, Issue 12, Dec. 2003 Page(s):3140-3159
    • (2003) IEEE Transactions on Information Theory , vol.49 , Issue.12 , pp. 3140-3159
    • Litsyn, S.1    Shevelev, V.2
  • 18
    • 0036539259 scopus 로고    scopus 로고
    • On ensembles of low-density parity-check codes: Asymptotic distance distributions
    • April Pages
    • Litsyn, S.; Shevelev, V.; On ensembles of low-density parity-check codes: asymptotic distance distributions, Information Theory, IEEE Transactions on Volume 48, Issue 4, April 2002 Page(s):887-908
    • (2002) Information Theory, IEEE Transactions on , vol.48 , Issue.4 , pp. 887-908
    • Litsyn, S.1    Shevelev, V.2
  • 20
    • 33846629974 scopus 로고    scopus 로고
    • Protograph Based LDPC Codes with Minimum Distance Linearly Growing with Block Size
    • D. Divsalar, C. Jones, S. Dolinar, J. Thorpe; Protograph Based LDPC Codes with Minimum Distance Linearly Growing with Block Size, IEEE Globecom 2005.
    • (2005) IEEE Globecom
    • Divsalar, D.1    Jones, C.2    Dolinar, S.3    Thorpe, J.4
  • 21
    • 0036913622 scopus 로고    scopus 로고
    • Asymptotic input-output weight distributions and thresholds of convolutional and turbo-like codes
    • December
    • I. Sason, E. Telatar and R. Urbanke, " Asymptotic input-output weight distributions and thresholds of convolutional and turbo-like codes," IEEE Trans. on Information Theory , vol. 48, no. 12, pp. 3052-3061, December 2002.
    • (2002) IEEE Trans. on Information Theory , vol.48 , Issue.12 , pp. 3052-3061
    • Sason, I.1    Telatar, E.2    Urbanke, R.3


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