#19959: A generic mechanism for bounds on linear code's parameters
-----------------------------+----------------------------
Reporter: dlucas | Owner:
Type: PLEASE CHANGE | Status: new
Priority: major | Milestone: sage-7.1
Component: coding theory | Keywords:
Merged in: | Authors:
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
-----------------------------+----------------------------
As discussed in #19623 (see comments 17 and below), it would be nice to
have, at some point, a generic mechanism to remember and carry on useful
information on codes.
Indeed, while performing computations with codes, some parameters might be
found, which would require some work to compute in another case.
E.g. while building a lookup table for syndrome decoding,
`minimum_distance` can be computed. As computing the minimum distance is
an exhaustive search over all the codewords, it would be a shame to lose
this information...
This ticket focuses on implementing such an machanism.
--
Ticket URL: <http://trac.sagemath.org/ticket/19959>
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 https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
