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

Which Codes Have 4 -Cycle-Free Tanner Graphs?

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

3 Author(s)
Halford, T.R. ; Commun. Sci. Inst., Univ. of Southern California, Los Angeles, CA ; Grant, A.J. ; Chugg, K.M.

Let C be an [n,k,d] binary linear code with rate R=k/n and dual C perp. In this correspondence, it is shown that C can be represented by a 4-cycle-free Tanner graph only if: pdperples lfloorradicnp(p-1)+n2/4+n/2 rfloorwhere p=n-k and dperp is the minimum distance of C perp. By applying this result, it is shown that 4-cycle- free Tanner graphs do not exist for many classical binary linear block codes

Published in:

Information Theory, IEEE Transactions on  (Volume:52 ,  Issue: 9 )

Date of Publication:

Sept. 2006

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.