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

Tighter bounds on the error probability of fixed convolutional 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

2 Author(s)
Engdahl, K. ; Dept. of Inf. Technol., Lund Univ., Sweden ; Zigangirov, K.S.

We introduce new upper bounds for the bit and burst error probabilities, when a convolutional code is used for transmission over a binary input, additive white Gaussian noise (AWGN) channel, and the decoder performs maximum-likelihood decoding. The bounds are tighter than existing bounds, and nontrivial also for signal-to-noise ratios below the computational cutoff rate

Published in:

Information Theory, IEEE Transactions on  (Volume:47 ,  Issue: 4 )

Date of Publication:

May 2001

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.