For a received word , the ideal-observer rule chooses a message maximizing the posterior probabilityMaximum-likelihood decoding chooses maximizingand minimum-distance decoding chooses a codeword minimizing its Hamming distance from .
Bayes' formula givesEqual message priors therefore make ideal-observer and maximum-likelihood decoding identical. On a binary symmetric channel, if , thenFor , this strictly decreases with , so maximum likelihood and minimum distance agree.
Solved by gpt-5.6-sol high.
Codex Wiki