By Topic

4-Cycle Free LDPC Codes Based on Difference Sets

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

2 Author(s)
M. Esmaeili ; Dept. of Math. Sci., Isfahan Univ. of Technol., Isfahan, Iran ; M. Javedankherad

Difference sets are used to give a novel method for constructing structured regular quasi-cyclic low-density parity-check codes. Let Fq be a field with q elements and assume that D={d1,..., dk} is a (v,k,1)-difference set for Zv with d1<;d2<;...<;dk. Depending on v=q-1, v≥ 2dk or v≥ 2dk-1, three code construction methods are given that produce regular 4-cycle free codes, that is codes with girth at least 6. Simulation results show that the constructed codes perform well over the AWGN channel with an iterative sum-product message-passing decoding algorithm.

Published in:

IEEE Transactions on Communications  (Volume:60 ,  Issue: 12 )