By Topic

Construction of nonbinary quasi-cyclic LDPC cycle codes based on singer perfect difference set

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
$33 $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 University ; Baoming Bai ; Xinmei Wang

A low-density parity-check (LDPC) code whose parity-check matrix consists of weight-2 columns is known as a cycle code. In this letter, we propose a construction of nonbinary quasi-cyclic (QC) LDPC cycle codes based on Singer perfect difference set. The Tanner graph has girth 12 and the code length achieves the Gallager lower bound. We further show that constructed codes have exactly a minimum symbol Hamming distance 6. Simulation results show that the proposed codes perform better than random nonbinary LDPC cycle codes.

Published in:

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