Parity-check matrix ($H$)

A parity-check matrix $H$ for a linear code $C$ satisfies

The syndrome of a received word $y$ with respect to a parity-check matrix $H$ is $s=H{y}^T$. It vanishes exactly when $y$ is a codeword and otherwise identifies the coset containing the error pattern.