#19653: New decoders for Generalized Reed-Solomon codes
-------------------------------------+-------------------------------------
Reporter: dlucas | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-7.1
Component: coding theory | Resolution:
Keywords: | Merged in:
Authors: David Lucas | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/dlucas/grs_decoders | d70d6aa219a0472d1e254a23b6e0427f5cc7e1b2
Dependencies: #18928, #19897 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by jsrn):
Awesome remarks Julien.
Just a small clarification
> * l. 1083: I dislike the function naming: `precompute` is too general. I
also think your documentation is not precise enough : there are many monic
polynomials vanishing on the evaluation points; your function returns the
only one whose zeroes are exactly the evaluation points.
To be clear: it returns the *minimal-degree* polynomial that vanishes at
all the evaluation points (in the algebraic closure, that's equivalent to
what you say, but perhaps not everyone would think like that).
--
Ticket URL: <http://trac.sagemath.org/ticket/19653#comment:18>
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.
