| |
| | [No title] |
 | | The rows of the {\it parity check matrix} of $C$ are a basis for the code, \[ C^* = \{ v \in GF(q)^n\ \ v\cdot c = 0,\ for \ all\ c \in C \}, \] called the {\it dual space} of $C$. |
 | | The associated {\it toric code} $C$ is the evaluation code which is the image of the evaluation map $$ eval_T : V \rightarrow F^n, $$ where $x^e$ is the multi-index notation ($x=(x_1,...,x_d)$, $e=(e_1,...,e_d)$, and $x^e = x_1^{e_1}...x_d^{e_d}$), where $eval_T (f(x)) = (f(t_1),...,f(t_n))$, and where $T=\{t_1,...,t_n\}$. |
 | | The cyclic code C associated to (g,n,F) is isomorphic as a vector space) to the principal ideal $(g)$ in the ring $R = F[x]/(x^n-1)$ generated by g. |
| modular.math.washington.edu /sagesrc/sage/coding/linear_code.py.txt (1811 words) |
|