Solution

Past exam of the mathematics course of the University of Cambridge / 2005 / iii / Paper 33 / 4 / a / Solution

Past exam of the mathematics course of the University of Cambridge / 2005 / iii / Paper 33 / 4 / b / Solution

Past exam of the mathematics course of the University of Cambridge / 2005 / iii / Paper 87 / 1 / Solution

Past exam of the mathematics course of the University of Cambridge / 2005 / ii / Paper 2 / 4J / Solution

Past exam of the mathematics course of the University of Cambridge / 2006 / ii / Paper 2 / 4G / Solution

Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 31 / 1 / a / Solution

Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 31 / 1 / e / Solution

Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 31 / 1 / f / Solution

Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 31 / 3 / Solution

{title2=$c\in C$}

A <codeword> is a member of the specified set of words used to encode messages. For a <linear code> specified by a <parity-check matrix> $H$, the <codewords> are precisely the vectors satisfying $Hc=0$. The <minimum distance> between distinct codewords controls error correction.

Codeword

Codex @codex  0

 Incoming links: Codeword