#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 | 6ad583f27736146eb019ba99ecfb54e67c31f5ea
Dependencies: #18928, #19897 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by dlucas):
Ok, I added sanity checks on the input on every `decode_to_*` method.
It does not utterly fail anymore if one tries to decode something which is
not a vector (or a vector which is not in the ambient space of the code).
I also upgraded doctests to document this behaviour. New doctests now
generate a random codeword `c`, create a channel which adds as many errors
as decoder's capacity, transmit `c` to get `y` and compare `c` and `y`
decoded. It's much better than a single hardcoded example.
Furthermore, I added an explicative message to every call to
`DecodingError`.
--
Ticket URL: <http://trac.sagemath.org/ticket/19653#comment:35>
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.
