Changes between Version 15 and Version 22 of Ticket #12418


Ignore:
Timestamp:
01/08/13 03:37:14 (8 years ago)
Author:
dimpase
Comment:

Please review. I added a Kravchouck speedup, and cleaned up docstrings as requested.

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #12418 – Description

    v15 v22  
    11Delsarte bound for codes, aka Linear Programming bound, is easy to implement in Sage.
    22
    3 See the attached prototype implementation for details.
    4 
    5 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.
     3To 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.
    64
    75Apply [attachment:12418_delsart_bounds.patch]