Merge branch 'u/arpitdm/mvp_mpe' of git://trac.sagemath.org/sage into mvp_mpe

Author: arpitdm

src/module_list.py

@@ -1668,6 +1668,9 @@ def uname_specific(name, value, alternative):
               sources = ['sage/rings/polynomial/skew_polynomial_finite_field.pyx']),
 
 
+    Extension('sage.rings.polynomial.skew_polynomial_finite_field',
+              sources = ['sage/rings/polynomial/skew_polynomial_finite_field.pyx']),
+
 
     ################################
     ##

src/sage/rings/polynomial/skew_polynomial_element.pyx

@@ -2540,6 +2540,37 @@ cdef class SkewPolynomial(AlgebraElement):
         """
         return self.parent().variable_name()
 
+    def multi_point_evaluation(self, eval_pts):
+        """
+        Evaluate skew polynomial at multiple evaluation points.
+
+        INPUT:
+
+        - ``eval_pts`` -- list of points at which ``self`` is to be evaluated
+
+        OUTPUT:
+
+        List of values of ``self`` at the `eval_pts`.
+
+        .. TODO::
+
+            This method currently trivially calls the evaluation function
+            repeatedly and should be updated to the recursive algorithm
+            from the paper "Fast Operations on Linearized Polynomials
+            and their Applications in Coding Theory" by Puchinger, et al.
+
+        EXAMPLES:
+
+            sage: k.<t> = GF(5^3)
+            sage: Frob = k.frobenius_endomorphism()
+            sage: S.<x> = k['x',Frob]
+            sage: a = x + t
+            sage: eval_pts = [1, t, t^2]
+            sage: c = a.multi_point_evaluation(eval_pts); c
+            [t + 1, 3*t^2 + 4*t + 4, 4*t]
+        """
+        return [ self(e) for e in eval_pts ]
+
 
 cdef class SkewPolynomial_generic_dense(SkewPolynomial):
     """