#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:
----------------------------------+-----------------------------------------
Old description:
> Delsarte bound for codes, aka Linear Programming bound, is easy to
> implement in Sage.
>
> See the attached prototype implementation for details.
>
> One obstacle for this to work well in big dimensions is a lack of
> arbitrary precision LP solver backend available in Sage. This is taken
> care of by #12533, which is a dependence for this ticket.
>
> Apply [attachment:12418_delsart_bounds.patch]
New description:
Delsarte bound for codes, aka Linear Programming bound, is easy to
implement in Sage.
To work well in big dimensions, one needs an arbitrary precision LP
solver. We use an LP backend to PPL, which is available in Sage since
#12533.
Apply [attachment:12418_delsart_bounds.patch]
--
Comment (by dimpase):
Please review. I added a Kravchouck speedup, and cleaned up docstrings as
requested.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12418#comment:22>
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.
