#20938: Decoder for Reed Muller Codes
-------------------------------------+-------------------------------------
Reporter: panda314 | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-7.3
Component: coding theory | Resolution:
Keywords: | Merged in:
Authors: Parthasarathi | Reviewers:
Panda |
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/dlucas/decoder_for_reed_muller_codes|
86c1629afaa869dd2086b6dd569939a66e3e4ad4
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by dlucas):
> What are ticket states? Is there a way to automate the merging with
latest version?
Oh, no, you have to merge it by hand. What I meant by ticket states is to
switch from `new` to `needs_review` when you finish working on it, etc.
>As far as i remember the reed solomon super code method is apllicable
only for q-ary reed muller codes with order<field_size. It is applicable
for binary reed muller code only if the order<=1. I guess i can allow for
such binary reed muller codes.
Yes, that would be great!
> Yeah i will add the option for using a reed solomon decoder. I had
arbitrarily picked Gao.
Ok, perfect.
David
--
Ticket URL: <https://trac.sagemath.org/ticket/20938#comment:5>
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.
