#18099: Prepare linear_code for inheritance
-------------------------------------+-------------------------------------
Reporter: dlucas | Owner:
Type: enhancement | Status: needs_info
Priority: major | Milestone: sage-6.6
Component: coding theory | Resolution:
Keywords: sd66 | Merged in:
Authors: David Lucas | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/dlucas/prepare_linear_code_for_inheritance|
57a4944f9f18915fbc8904631d622aeb4619b306
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by jsrn):
Hi Vincent and David,
Actually, having reflected about it I think I now get Vincent's point on
generator matrices. Perhaps the doc for the class `LinearCode` could be
improved to something like
Linear codes over a finite field or finite ring, represented using a
generator matrix.
This class should be used for arbitrary and unstructured linear codes.
This
means that basic operations on the code, such as the computation of
the
minimum distance, will use generic, slow algorithms.
If you are looking for constructing a code from a more specific
family, see
if the family has been implemented by investigating `codes.<tab>`.
These
more specific classes use properties particular for that family to
allow
faster algorithms, and could also have family-specific methods.
--
Ticket URL: <http://trac.sagemath.org/ticket/18099#comment:43>
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/d/optout.
