By Topic

Cycle and Distance Properties of Structured LDPC Codes Based on Circulant Permutation Matrices

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)
Jean-Baptiste Dore ; France Telecom, Research and Development Division, 4 rue du clos courtel, 35512 Cesson-Sévigné, France. ; Marie-Helene Hamon ; Pierre Penard

This paper investigates cycle and distance properties of structured Low Density Parity Check (LDPC) codes based on circulant permutation matrices. A very simple algorithm to detect and construct codes with good cycle properties is proposed. A geometrical approach to design codes with good girth properties is then presented and illustrated, through the definition of rules for the design of parity check matrices without short length cycles. An upper bound on the minimal distance of the proposed structured code is also derived. The information provided by this bound can help the construction of the parity check matrices, in order to achieve a target minimum distance.

Published in:

Information Theory, 2007. CWIT '07. 10th Canadian Workshop on

Date of Conference:

6-8 June 2007