A Construction of High Rate Quasi-Cyclic Regular LDPC Codes from Cyclic Difference Families with Girth 8
| Autor: | Masaya Fujisawa, Shojiro Sakata |
|---|---|
| Rok vydání: | 2007 |
| Předmět: |
Discrete mathematics
Applied Mathematics Concatenated error correction code Girth (graph theory) Computer Graphics and Computer-Aided Design Linear code Small set Combinatorics Combinatorial design Cyclic code Signal Processing Electrical and Electronic Engineering Low-density parity-check code Hamming code Mathematics |
| Zdroj: | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :1055-1061 |
| ISSN: | 1745-1337 0916-8508 |
| DOI: | 10.1093/ietfec/e90-a.5.1055 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|