#17452: LinearCode should check the rank
-------------------------------------+-------------------------------------
Reporter: vdelecroix | Owner:
Type: defect | Status: positive_review
Priority: major | Milestone: sage-6.5
Component: coding theory | Resolution:
Keywords: | Merged in:
Authors: Vincent Delecroix | Reviewers: Nathann Cohen
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/vdelecroix/17452 | 173f3ece741427bbc40f3f91305e0a14391ea7fb
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by vdelecroix):
To answer your question, I guess that the GAP function
`AClosestVectorCombinationsMatFFEVecFFECoords` is really stupid: it just
runs through all possible linear combinations with no zero coefficient
(though, I did not look at the source code). Anyway, it is fast enough on
reasonable input. From this function, if you obtain a 0 it means that your
input vectors were not linearly independent (and its perfectly fine from
the specification above). It perhaps would be safer to through an error
there instead of silently ignore it.
Vincent
--
Ticket URL: <http://trac.sagemath.org/ticket/17452#comment:5>
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.
