The Answer to the Question
is below this banner.
Here's the Solution to this Question
An (m,n) encoding ∅ corrects
K or fewer errors if and only if the minimum distance between encoded words is atleast 2K+1
Suppose that ∅ corrects K or fewer errors x is an encoded word of distance 1≤j≤k from the encoded word y.