Opened 10 years ago
Last modified 8 years ago
#12418 closed enhancement
adding Delsarte bound for codes — at Version 10
Reported by: | dimpase | Owned by: | wdj |
---|---|---|---|
Priority: | major | Milestone: | sage-5.12 |
Component: | coding theory | Keywords: | |
Cc: | jpang, kini, wdj, ncohen, ppurka, ptrrsn_1 | 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 (almost - i.e. the corresponding ticket is still not 100% ready, as reviewers think) taken care of by #12533, which is a dependence for this ticket.
Change History (11)
comment:1 Changed 10 years ago by
comment:2 Changed 10 years ago by
- Cc kini added
comment:3 Changed 10 years ago by
- Cc wdj added
comment:4 Changed 10 years ago by
- Cc ncohen added
- Description modified (diff)
comment:5 Changed 10 years ago by
comment:6 Changed 10 years ago by
- Cc ppurka added
comment:7 Changed 10 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 10 years ago by
- Cc ptrrsn_1 added
comment:9 Changed 10 years ago by
- Description modified (diff)
comment:10 Changed 9 years ago by
- Dependencies set to #12533
- Description modified (diff)
(GLPK can solve non-integer rational LP. It is not exposed, but may not be too hard either)