#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 | 6e4b0746b3daffbd18c0c874612f957f0ef2a919
Dependencies: #18928, #19897 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by jsrn):
I was actually checking something completely different, but then I noticed
that the key equation syndrome decoder has absolutely no sanity checks! If
too many errors occurred, or you just gave it a random input, then it will
always return something, and often not a codeword!
In the same vain, are you sure that the output of the other decoders will
always be codewords? I don't think the divisibility test is sufficient.
--
Ticket URL: <http://trac.sagemath.org/ticket/19653#comment:33>
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.
