#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 vdelecroix):
Currently in Sage you can only build linear codes over finite fields. The
only tentative to generalize it (though only to the rings `ZZ/nZZ`) is
#6452. Note that this ticket not add directly a new linear code function
but rather focuses on having a nice class for submodules of `(ZZ/nZZ)^r`
which is exactly what linear codes are about.
And [https://en.wikipedia.org/wiki/Linear_code wikipedia] says that linear
code are over finite fields.
--
Ticket URL: <http://trac.sagemath.org/ticket/19462#comment:8>
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.
