On the Absorbing Sets of the Regular LDPC Codes with Variable Node Degree Three 


Vol. 34,  No. 10, pp. 937-945, Oct.  2009


PDF
  Abstract

In this paper, we investigate into the existence and various properties of absorbing sets in regular LDPC codes with variable node degree three. Also, we figure out the critical number of some absorbing sets that are believed to be the major cause of error floor in (3,5) Tanner LDPC codes.

  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]

K. Lee, H. Chung, H. Jang, "On the Absorbing Sets of the Regular LDPC Codes with Variable Node Degree Three," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 10, pp. 937-945, 2009. DOI: .

[ACM Style]

Kijun Lee, Habong Chung, and Hwanseok Jang. 2009. On the Absorbing Sets of the Regular LDPC Codes with Variable Node Degree Three. The Journal of Korean Institute of Communications and Information Sciences, 34, 10, (2009), 937-945. DOI: .

[KICS Style]

Kijun Lee, Habong Chung, Hwanseok Jang, "On the Absorbing Sets of the Regular LDPC Codes with Variable Node Degree Three," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 10, pp. 937-945, 10. 2009.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880