#12418: adding Delsarte bound for codes
---------------------------------+------------------------------------------
Reporter: dimpase | Owner: wdj
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.4
Component: coding theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: #12533 | 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.
It's probably even faster to compute by using recurrence relations, but I
don't think it's important here: LP solving timing clearly dominates the
rest.
By the way, would it be interesting to include an option to compute bounds
on codes with a prescribed forbidden
set of distances, rather than just [1..d] ? It's a trivial add-on.
I did this in a prototype code for Johnson schemes,
[http://mathoverflow.net/questions/111603/intersecting-4-sets/111647#111647
here].
Any other interesting schemes to include? (Johnson scheme takes care of
constant weight binary codes, as you know.)
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12418#comment:14>
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.
