EvaluationCode is the class of linear codes obtained by evaluating polynomials in $F[X_1,\ldots,X_m]$, where $F$ is a finite field, at a set of points in $F^m$. There are various constructions of evaluation codes depending on how the polynomials and points are chosen. Important examples include Reed-Solomon codes, Reed-Muller codes, monomial codes, Cartesian codes, and toric codes. To construct a linear code, see evaluationCode.
The basic structure is a hash table. One of the values is the resulting linear code of type LinearCode. Other values include the set of points, its vanishing ideal, the set of polynomials, and more.
|
|
|
|
|
|
|
|
|
|
The object EvaluationCode is a type, with ancestor classes HashTable < Thing.
The source of this document is in /build/reproducible-path/macaulay2-1.25.06+ds/M2/Macaulay2/packages/CodingTheory.m2:4554:0.