Answers are grounded in this paper and cite their sources.
A decoding rule is presented which minimizes the probability of symbol error over a time-discrete memory]ess channel for any linear error-correcting code when the codewords are equiprobable. The complexity of this rule varies inversely with code rate, making the technique particularly attractive for high rate codes. Examples are given for both block and convolutional codes.
No takes yet. Share an insight, caveat, or question.
Hartmann et al. (1976) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: