The least stringent sufficient condition on the optimality of suboptimally decoded codewords
- 19 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoderIEEE Transactions on Information Theory, 1994
- An improvement to generalized-minimum-distance decodingIEEE Transactions on Information Theory, 1991
- Class of algorithms for decoding block codes with channel measurement informationIEEE Transactions on Information Theory, 1972