By Topic

Construction of quasi-cyclic LDPC codes based on a two-dimensional MDS code

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chao Chen ; State Key Lab. of ISN, Xidian Univ., Xi''an, China ; Baoming Bai ; Xinmei Wang

In this letter, we first propose a general framework for constructing quasi-cyclic low-density parity-check (QCLDPC) codes based on a two-dimensional (2-D) maximum distance separable (MDS) code. Two classes of QC-LDPC codes are defined, whose parity-check matrices are transposes of each other. We then use a 2-D generalized Reed-Solomon (GRS) code to give a concrete construction. The decoding parity-check matrices have a large number of redundant parity-check equations while their Tanner graphs have a girth of at least 6. The minimum distances of the codes are very respectable. Experimental studies show that the constructed QC-LDPC codes perform well with the sum-product algorithm (SPA).

Published in:

Communications Letters, IEEE  (Volume:14 ,  Issue: 5 )