#18960: Strongly Regular Graphs from two-weight codes
-------------------------+-------------------------------------------------
Reporter: | Owner:
ncohen | Status: needs_review
Type: | Milestone: sage-6.9
enhancement | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers:
theory | Work issues:
Keywords: | Commit:
Authors: | 6390dd942ab5c913d08ba183c84be76a876baf93
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
u/ncohen/18960 |
Dependencies: |
#18948 |
-------------------------+-------------------------------------------------
Comment (by dimpase):
`It is said to be *projective* if any two of its codewords are linearly
independent.`
This needs an extra care: a projective code, if defined this way, cannot
contain the all-0 word.
(Usually a projective code is defined as a subset of points in a
projective space; your definition is OK, if you add that it does not
contain an all-0 word).
--
Ticket URL: <http://trac.sagemath.org/ticket/18960#comment:6>
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.
