An Algorithm for Computing Rejection Probability of MLD with Threshold Test over BSC

Authors:
Tadashi Wadayama
Affiliations:
-
Venue:
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Year:
2001

Citing 3
Cited 0

On the undetected error probability of linear block codes on channels with memory

IEEE Transactions on Information Theory
The weight distributions of extended binary primitive BCH codes of length 128

IEEE Transactions on Information Theory
Composite scheme LR+Th for decoding with erasures and its effective equivalence to Forney's rule

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm for evaluating the decoding performance of maximum likelihood decoding (MLD) with threshold test over a binary symmetric channel (BSC) is presented. The proposed algorithm, which is based on the dynamic programming principle, computes the exact values of correct correction, rejection and undetected-error probabilities. The computational complexity of the algorithm is O(n2(1-r)n), where n and r denote length and coding rate of the code.