Opened 11 years ago
Last modified 9 years ago
#12418 closed enhancement
adding Delsarte bound for codes — at Version 11
Reported by: | Dima Pasechnik | Owned by: | David Joyner |
---|---|---|---|
Priority: | major | Milestone: | sage-5.12 |
Component: | coding theory | Keywords: | |
Cc: | John Pang, Keshav Kini, David Joyner, Nathann Cohen, Punarbasu Purkayastha, Risan | Merged in: | |
Authors: | Reviewers: | ||
Report Upstream: | N/A | Work issues: | |
Branch: | Commit: | ||
Dependencies: | #12533 | Stopgaps: |
Description (last modified by )
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 this patch
Change History (12)
comment:2 Changed 11 years ago by
Cc: | Keshav Kini added |
---|
comment:3 Changed 11 years ago by
Cc: | David Joyner added |
---|
comment:4 Changed 11 years ago by
Cc: | Nathann Cohen added |
---|---|
Description: | modified (diff) |
comment:5 Changed 11 years ago by
comment:6 Changed 11 years ago by
Cc: | Punarbasu Purkayastha added |
---|
comment:7 Changed 11 years ago by
The function named delsarte_bound
should be renamed to something like delsarte_bound_hamming_space
. This is so that in future other functions like delsarte_bound_johnson_space
, delsarte_bound_permutation_space
, etc can be added easily, without having inconsistencies in naming.
comment:8 Changed 11 years ago by
Cc: | Risan added |
---|
comment:9 Changed 10 years ago by
Description: | modified (diff) |
---|
comment:10 Changed 10 years ago by
Dependencies: | → #12533 |
---|---|
Description: | modified (diff) |
comment:11 Changed 10 years ago by
Description: | modified (diff) |
---|---|
Status: | new → needs_review |
(GLPK can solve non-integer rational LP. It is not exposed, but may not be too hard either)