Generalization of Tanner's Minimum Distance Bounds for LDPC Codes 


Vol. 29,  No. 10, pp. 1363-1369, Oct.  2004


PDF
  Abstract

LDPC(Low Density Panty Check) codes are described by bipartite graphs with bit nodes and parity-check nodes. Tanner derived minimum distance bounds of the regular LDPC code in terms of the eigenvalues of the associated adjacency matrix In this paper we generalize the Tanner's results We derive minimum distance bounds applicable to both regular and blockwise-irregular LDPC codes, The first bound considers the relation between bit nodes ill a minimum-weight code word, and the second one considers the connectivity between panty nodes adjacent to a minimum-weight codeword. The derived bounds make It possible to describe the distance property of the code in terms of the eigenvalues of the associated matrix.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

M. Shin, J. Kim, H. Song, "Generalization of Tanner's Minimum Distance Bounds for LDPC Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 10, pp. 1363-1369, 2004. DOI: .

[ACM Style]

Min-Ho Shin, Joon-Sung Kim, and Hong-Yeop Song. 2004. Generalization of Tanner's Minimum Distance Bounds for LDPC Codes. The Journal of Korean Institute of Communications and Information Sciences, 29, 10, (2004), 1363-1369. DOI: .

[KICS Style]

Min-Ho Shin, Joon-Sung Kim, Hong-Yeop Song, "Generalization of Tanner's Minimum Distance Bounds for LDPC Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 10, pp. 1363-1369, 10. 2004.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880