An Algorithm for Computing Rejection Probability of MLD with Threshold Test over BSC
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
On the complexity of suboptimal decoding for list and decision feedback schemes
Discrete Applied Mathematics - Special issue: Coding and cryptography
On the complexity of suboptimal decoding for list and decision feedback schemes
Discrete Applied Mathematics - Special issue: Coding and cryptography
Performance bounds for erasure, list and decision feedback schemes with linear block codes
IEEE Transactions on Information Theory
| Hi-index | 754.90 |
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