Content deleted Content added
m →Minimum distance decoding: copyedit |
→Minimum distance decoding: add notes on when this is a good method to use |
||
Line 61:
which (since ''p'' is less than one half) is maximised by minimising ''d''.
Minimum distance decoding is also known as ''nearest neighbour decoding''. It can be assisted or automated by using a [[standard array]]. Minimum distance decoding is a reasonable decoding method when the following conditions are met:
:#The probability <math>p</math> that an error occurs is independent of the position of the symbol
:#Errors are independent events - an error at one position in the message does not affect other positions
These assumptions may be reasonable for transmissions over a binary symmetric channel. They may be unreasonable for other media, such as a DVD, where a single scratch on the disk can cause an error in many neighbouring symbols or codewords.
As with other decoding methods, a convention must be agreed to for non-unique decoding.
| |||