#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 | fca099ed40912d26eff991fc612ee793681000c5
Dependencies: #18928, #19897 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by dlucas):
Ok, I found something very annoying while working on writing an actual
check on the output of decoding algortihms:
{{{
sage: C = codes.GeneralizedReedSolomonCode(GF(59).list()[1:40+1], 12)
sage: c1 = C.random_element()
sage: c2 = C[1]
sage: c1.parent() == c2.parent()
False
}}}
So if the input of `decode_to_code`, say `r` is generated through
`random_elements`, all code like t his:
{{{
(r - decoded_word).hamming_weight() > self.decoding_radius():
raise DecodingError("Decoding failed because the number of errors
exceeded the decoding radius")
}}}
systematically fails because one cannot properly subtract two vectors
whose parents are diffrent.
So I'll check my `random_element` method...
--
Ticket URL: <http://trac.sagemath.org/ticket/19653#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.
