Decoding methods: Difference between revisions

Revision as of 02:38, 25 February 2008

Revision as of 03:03, 25 February 2008

Line 60:

which (since ''p'' is less than one half) is maximised by minimising ''d''.

Minimum distance decoding is also known as ''nearest neighbour decoding''. Decoding 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.

Line 103 ⟶ 105:

if and only if <math>x=y</math>. This is because the parity check matrix <math>H</math> is a generator matrix for the dual code <math>C^\perp</math> and hence is of full [[rank (linear algebra)|rank]].

== References ==

* Hill, Raymond. (1988). ''A First Course In Coding Theory'', New York: Oxford University Press.

[[Category:coding theory]]

[[Category:coding theory]]

[[fr:Méthode de décodage]]