By Topic

On the suboptimality of iterative decoding for finite length 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

3 Author(s)
Isaka, M. ; Dept. of Informatics, Kwansei Gakuin Univ., Japan ; Fossorier, M. ; Imai, H.

We investigate the property of iterative decoding for finite length codes, and give some insights on the suboptimality of iterative decoding due to the cycles in the graph representation of the codes, for several different types of iteratively decodable codes.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference:

2002