#12418: adding Delsarte bound for codes
----------------------------------+-----------------------------------------
Reporter: dimpase | Owner: wdj
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.6
Component: coding theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: #12533, #13650 | Stopgaps:
----------------------------------+-----------------------------------------
Comment (by dimpase):
Replying to [comment:12 ppurka]:
> I think the `Krawtchouk` polynomial could be computed explicitly by not
making repeated calls to `binomial`. This should speed it up. I have
something like this in mind:
This can be further optimized by using Horner's rule. I'll do this, and
leave the rest (other schemes) for another ticket, OK?
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12418#comment:20>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
