Minimum Distance Search Algorithms of LDPC Codes and RA Codes 


Vol. 31,  No. 3, pp. 207-213, Mar.  2006


PDF
  Abstract

In this paper, we reduce the computational complexity to find the minimum distance of RA codes by searching only valid codewords using repetition part. Since LDPC codes have repetition part like RA codes, we also apply this algorithm for computing the minimum distance of LDPC codes. The minimum distance dominates the code performance at high signal-to-noise ratios(SNRs) and in turn allows an estimate of the error floor. The proposed algorithm computes the minimum distance without any constraint on code structures. The minimum distances of LDPC codes and RA codes with large interleavers of practical importance are computed and used to obtain the error floor, which is compared with the performance of the iterative decoding.

  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. Chung, "Minimum Distance Search Algorithms of LDPC Codes and RA Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 3, pp. 207-213, 2006. DOI: .

[ACM Style]

Kyuhyuk Chung. 2006. Minimum Distance Search Algorithms of LDPC Codes and RA Codes. The Journal of Korean Institute of Communications and Information Sciences, 31, 3, (2006), 207-213. DOI: .

[KICS Style]

Kyuhyuk Chung, "Minimum Distance Search Algorithms of LDPC Codes and RA Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 3, pp. 207-213, 3. 2006.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880