By Topic

A trellis-based method for removing cycles from bipartite graphs and construction of low density parity check codes

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

5 Author(s)
Lan, L. ; Dept. of Electr. & Comput. Eng., Univ. of California, Davis, CA, USA ; Tai, Y.Y. ; Chen, L. ; Lin, S.
more authors

This letter presents a trellis-based iterative method for removing short cycles from bipartite graphs. This method can be used to improve the performance of low density parity check (LDPC) codes or to construct new LDPC codes.

Published in:

Communications Letters, IEEE  (Volume:8 ,  Issue: 7 )