#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: | 606d15fbf46b427ed47a92e7250d75f4711cdd78
Nathann Cohen | Stopgaps:
Report Upstream: N/A |
Branch: |
u/ncohen/18960 |
Dependencies: |
#18948 |
-------------------------+-------------------------------------------------
Comment (by dimpase):
Replying to [comment:7 ncohen]:
> Hmmmm... Too bad you did not review van Lint and Schrijver's paper, for
this is a copy paste of definition 2 (page 2) of their paper `:-P`
>
> http://link.springer.com/article/10.1007%2FBF02579178#page-1
well, it's behind a paywall for me (and Oxford - although we should have a
paper copy)
Anyhow, your correction does not go far enough: namely, a projective code
cannot have all-0 codeword, in all the (free) internet sources I can find.
--
Ticket URL: <http://trac.sagemath.org/ticket/18960#comment:10>
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.
