Decoding methods: Difference between revisions

Revision as of 19:25, 11 November 2006

Revision as of 19:26, 11 November 2006

Line 1:

This article discusses common methods in [[communication theory]] for decoding [[code|codewords]] sent over a noisy channel (such as a [[binary symmetric channel]]).

==Notation==

aDELA iS SO COOL, LIKE NO ONE CANT TOP HOW COOL SHE ISSS SERIOUSLY

Henceforth <math>C \subset \mathbb{F}_2^n</math> shall be a (not necessarily [[linear code|linear]]) [[code]] of length <math>n</math>; <math>x,y</math> shall be elements of <math>\mathbb{F}_2^n</math>; and <math>d(x,y)</math> shall represent the [[Hamming distance]] between <math>x,y</math>.

==Ideal observer decoding==