#19462: LinearCode.is_projective
-------------------------+-------------------------------------------------
Reporter: | Owner:
ncohen | Status: needs_review
Type: | Milestone: sage-6.10
enhancement | Resolution:
Priority: major | Merged in:
Component: | Reviewers:
coding theory | Work issues:
Keywords: | Commit:
Authors: | 4a8d9701a24ab0437ff4e8fbf517bb47443ef425
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
public/19462 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by ncohen):
> Because checking duplicates in a list of size `|size of the field| x
nrows` is longer than in a list of size `nrows`.
This is a good justification for a field-specific version of this 5-lines
algorithm. Not a justification for not supporting rings at all.
> I have no idea whether linear code over rings will be one day
supported... ticket #6452 is just a first step. And I was just mentioning
it to make some advertisement. But nobody cares.
I have no idea either, but unless it is written somewhere that we can
assume fields only, you won't see me adding a code that assumes more than
it should.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/19462#comment:13>
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.
