By Topic

Turbo codes and Shannon's condition for reliable communication

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

4 Author(s)

Block transmission over noisy communication channels is characterized by two performance criteria: the bit error probability Pb and the block error probability PB. If PB goes to zero when N→∞ (where N denotes the length of the permutors), Pb also must go to zero for all symbols in the block but, in general, the reverse is not true. Therefore we formulate the Shannon's condition for reliable communication over noisy channels. In this paper, we address the problem of reliable communication for iterative decoding of turbo codes.

Published in:

Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on

Date of Conference:

27 June-2 July 2004