Constructing High-Rate QC-LDPC Codes with Large-Girth based on Shortened Array Codes
Abstract
In this paper, we aim at constructing high-rate quasi-cyclic low-density parity-check (QC-LDPC) codes with girth-10 based on shortened array codes. Our first contribution is the derivation of analytic results on the maximum number of columns for shortened array codes of different girths. Then, inspired by the analysis, we propose a code construction method for column-weight-three codes. We further compare the minimum length and the error performance of the column-weight-three codes constructed by the proposed algorithm and those found by the conventional greedy construction algorithm. We show that the proposed method is more effective than the conventional greedy algorithm in the sense that the minimum length of the codes constructed using the proposed method to achieve different code rates is comparative or much shorter than those constructed using the greedy construction.
Published
2011-12-31
Section
Invited articles
An author's submission implies that the manuscript has not been published previously, and is not currently submitted for publication elsewhere. Submission also implies that the Corresponding Author has consent of all authors (the Authors). Upon acceptance for publication transfer of copyright will be made to the Publisher of REV-JEC, who guarantees that full content of the published article is freely distributed on the Journal's website. The copyright transfer gives the Publisher of REV-JEC full authority to resolve any complaints of misuse or abuse (such as infringement or plagiarism) of the published article. The Authors have the freedom to redistribute and reuse the published article in any medium or format for any purpose, provided the original published article is properly cited. An article submission implies author agreement with this policy.
