By Topic

The complexity of decoders--II: Computational work and decoding time

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

1 Author(s)

The computational work and the time required to decode with reliability E at code rate R on noisy channels are defined, and bounds on the size of these measures are developed. A number of ad hoc decoding procedures are ranked on the basis of the computational work they require.

Published in:

Information Theory, IEEE Transactions on  (Volume:17 ,  Issue: 1 )