#12418: adding Delsarte bound for codes
----------------------------------+-----------------------------------------
Reporter: dimpase | Owner: wdj
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.11
Component: coding theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: #12533, #13650 | Stopgaps:
----------------------------------+-----------------------------------------
Changes (by dimpase):
* status: needs_work => needs_review
Old 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]
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]
* [attachment:12418_update.patch]
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12418#comment:37>
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 http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/groups/opt_out.
