By Topic

Composite scheme LR+Th for decoding with erasures and its effective equivalence to Forney's rule

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)
Hashimoto, T. ; Dept. of Electr. Eng., Univ. of Electro-Commun., Tokyo, Japan

For decoding with erasures, Forney's scheme is known to be optimal in the sense that no other scheme can make the erasure probability Pers and undetected error probability Puer simultaneously smaller. We propose a scheme for erasure decision which tests the likelihood ratio as well as the likelihood itself and show that the attainable upper bounds on Pers and Puer are the same as those proved for the optimal scheme up to a constant factor. We also show that the scheme gives, when applied to convolutional codes, a bound which is related to the block-coding bound via Forney's inverse concatenation construction. We show that this bound is the same as the one which naturally arises when we apply Raghavan and Baum's (1998) optimal scheme to convolutional code

Published in:

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