evaluationCode(F,P,S)
evaluationCode(F,P,M)
We present below the ways in how an evaluation code $C$ can be defined.
evaluationCode(F,P,S)
Given a finite field F, an ordered list P of points in F$^m$, and an ordered list S of polynomials over F in $m$ variables, this method produces an EvaluationCode $C$ generated by codewords obtained by evaluating the given polynomials in S at the given points in P.
|
|
|
|
|
evaluationCode(F,P,M)
Given a finite field F, an ordered list P of points in F$^m$, and a matrix M with $m$ columns, this method produces a linear code $C$ generated by the codewords obtained by evaluating the monomials defined by the rows of M at the given points in P.
|
|
|
|
|
While this function may work even when a ring is given, instead of a finite field, it is possible that the results are not the expected ones.
The object evaluationCode is a method function with options.