Cart (Loading....) | Create Account
Close category search window
 

Design of non-binary quasi-cyclic LDPC codes based on multiplicative groups and Euclidean geometries

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

2 Author(s)
Jiang, Xueqin ; Department of Communications and Electronic Engineering, Donghua University, China ; Lee, Moon Ho

This paper presents an approach to the construction of non-binary quasi-cyclic (QC) low-density parity-check (LDPC) codes based on multiplicative groups over one Galois field GF(q) and Euclidean geometries over another Galois field GF(2s). Codes of this class are shown to be regular with girth 6 ≤ g ≤ 18 and have low densities. Finally, simulation results show that the proposed codes perform very well with the iterative decoding.

Published in:

Communications and Networks, Journal of  (Volume:12 ,  Issue: 5 )

Date of Publication:

Oct. 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.