Generalized minimum distance decoding
G. David Forney · IEEE Transactions on Information Theory · 1966
We introduce a new distance measure which permits likelihood information to be used in algebraic minimum distance decoding techniques. We give an efficient decoding algorithm, and develop exponential bounds on the probability of not decoding correctly. In one application, this technique yields the same probability of error as maximum likelihood decoding.
Cited by 565 works. doi:10.1109/tit.1966.1053873
Authors
References
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Principles of Communication Engineering
- Error-Correcting Codes.
- ERROR DETECTING AND ERROR CORRECTING CODES
- Error Detecting and Error Correcting Codes
- On a class of error correcting binary group codes
- Codes correcteurs d'erreurs
- On decoding BCH codes
- Further results on error correcting binary group codes
- The use of information sets in decoding cyclic codes