By Topic

A class of quasi-cyclic LDPC codes over GF(2m)

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)
Christian Spagnol ; Dept. of Electrical and Electronic Engineering, University College Cork, Ireland. ; William Marnane

Low Density Parity Check (LDPC) codes over GF(2m,)are an extension of binary LDPC codes. Performances of GF(2m,) LDPC codes have been shown to be higher than binary LDPC codes, but the complexity of the encoders/decoders increases. Hence there is a substantial lack of implementations for LDPC codes over GF(2m,)codes. This paper presents a class of quasi-cyclic LDPC codes over GF(2m,). These codes can alleviate the encoding/decoding complexity without excessive loss of performances. It is shown how, from a performance point of view, such codes are better than m times bigger binary codes and as good as (2m,)longer binary codes.

Published in:

IEEE Transactions on Communications  (Volume:57 ,  Issue: 9 )