A Construction of High Rate Quasi-Cyclic Regular LDPC Codes from Cyclic Difference Families with Girth 8(Coding Theory)

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper we propose a method of constructing quasi-cyclic regular LDPC codes from a cyclic difference family, which is a kind of combinatorial design. The resulting codes have no 4-cycle, i.e. cycles of length four and are defined by a small set of generators of codes with high rate and large code length. In particular, for LDPC codes with column weight three, we clarify the conditions on which they have no 6-cycle and their minimum distances are improved. Finally, we show the performance of the proposed codes with high rates and moderate lengths.

• 一般社団法人電子情報通信学会の論文
• 2007-05-01

著者

• Sakata Shojiro

  Univ. Electro‐communications Chofu‐shi Jpn

• Sakata Shojiro

  Department Of Computer Science And Information Mathematics The University Of Electro-communications

• Fujisawa Masaya

  Sci. Univ. Tokyo Tokyo Jpn

• Fujisawa Masaya

  Department Of Industrial Management & Engineering Tokyo University Of Science

関連論文

• On a Class of Byte-Error-Correcting Codes from Algebraic Curves and Their Fast Decoding Algorithm (Special Section on information Theory and Its Applications)
• Determination of Unknown Syndromes in Parallel Decoding of Codes from Algebraic Curves with Systolic Array
• With a higher probability one can correct errors up to half the designed distance for primal codes from curves
• Compound-Error-Correcting Codes and Their Augmentation(Coding Theory)
• A Construction of High Rate Quasi-Cyclic Regular LDPC Codes from Cyclic Difference Families with Girth 8(Coding Theory)

スポンサーリンク