#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 dlucas):
I removed `__ne__` method in every decoder as a generic one was
implemented in another ticket, so these ones are useless.
Now, for the broken doctests, I'm experiencing a weird problem: while
trying to build a [10, 5, 6]-GRS code (lines 1549, 1591, 1631 and 1669)
the doctesting framework (`sage -t grs.py`) actually builds a [9, 5,
5]-GRS code.
Which is quite weird, because if I copy these lines in my Sage terminal,
everything works perfectly...
Everything else is still on the clear, so I consider this suitable for
review. I'm of course working on the above.
David
--
Ticket URL: <http://trac.sagemath.org/ticket/19653#comment:16>
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.
