X-Nico

CSS code

Let $C\; 1$ and $C\; 2$ be two (classical) $n,k\; 1$, $n,k\; 2$ codes such, that $C\; 2\; \backslash subset\; C\; 1$ and $C\; 1\; ,\; C\; 2^\backslash perp$ both have minimal distance $\backslash geq\; 2t+1$, where $C\; 2^\backslash perp$ is the code dual to $C\; 2$.

•

In quantum error correction, CSS codes, named after their inventors, Robert Calderbank, Peter Shor and Andrew Steane, are a special type of Stabilizer codes constructed from classical codes with some special properties.

see also