Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
G. David Forney (1966) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: