#20705: Classes for Reed Muller Codes
-------------------------------------+-------------------------------------
Reporter: panda314 | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-7.3
Component: coding theory | Resolution:
Keywords: | Merged in:
Authors: Parthasarathi | Reviewers: David Lucas
Panda | Work issues:
Report Upstream: N/A | Commit:
Branch: | 13cda90026b28644ed1c018d7628ea1e007cd4ef
u/dlucas/classes_for_reed_muller_codes| Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by jsrn):
Replying to [comment:37 panda314]:
> Regarding '17.' Is there any way one can pass a sub ring of a
multivariate polynomial ring consisting of polynomials over a subset of
the variables? Like F[x_1,x_2,x_3] is to F[x_1,x_2,x_3,x_4]? The
num_of_var parameter used in the function sort of does that.
Ah yes, ok that's a good point. You *can* make such a sub-ring but perhaps
that could get inefficient. Instead, you can restructure
`_multivariate_polynomial_interpolation` with a local function:
{{{
def _multivariate_polynomial_interpolation(evaluations, order,
polynomial_ring):
def _interpolate(evaluations, order, num_of_var):
...
for k in range(d): # computing the polynomial
poly = poly + z *
_interpolate([multipoint_evaluation_list[i][k] for i in range(n_by_q)],
order -
k, num_of_var - 1)
z = z * x
return poly
return _interpolate(evaluations, order, len(polynomial_ring.gens()))
}}}
--
Ticket URL: <http://trac.sagemath.org/ticket/20705#comment:40>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
