Revision as of 03:35, 25 February 2008 edit Culix (talk \| contribs) Extended confirmed users 1,779 edits Add →See also: section ← Previous edit		Revision as of 03:38, 25 February 2008 edit undo Culix (talk \| contribs) Extended confirmed users 1,779 edits m →Minimum distance decoding: copyedit Next edit →
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''. ~~Decoding~~It can be assisted or automated by using a [[standard array]]. As with other decoding methods, a convention must be agreed to for non-unique decoding.

Decoding methods: Difference between revisions