On the Construction of Quasi-Cyclic Low-Density Parity-Check Codes Based on Girth(Coding Theory)

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, we propose a method for constructing quasicyclic low-density parity-check codes randomly using cyclic shift submatrices on the basis of the girth of the Tanner graphs of these codes. We consider (3, K)-regular codes and first derive the necessary and sufficient conditions for weight-4 and weight-6 codewords to exist. On the basis of these conditions, it is possible to estimate the probability that a random method will generate a (3, K)-regular code with a minimum distance less than or equal to 6, and the proposed method is shown to offer a lower probability than does conventional random construction. Simulation results also show that it is capable of generating good codes both regular and irregular.

• 社団法人電子情報通信学会の論文
• 2004-09-01

著者

• Okamura Toshihiko

  Nec Internet System Research Laboratories

関連論文

• On the Construction of Quasi-Cyclic Low-Density Parity-Check Codes Based on Girth(Coding Theory)

スポンサーリンク