Mathematics – Combinatorics
Scientific paper
2009-03-29
Congressus Numerantium, {\bf 193}(2008), 175--194, {\bf MR}2487725; 94B05, (05C90)
Mathematics
Combinatorics
20 pages
Scientific paper
A binary extended 1-perfect code $\mathcal C$ folds over its kernel via the Steiner quadruple systems associated with its codewords. The resulting folding, proposed as a graph invariant for $\mathcal C$, distinguishes among the 361 nonlinear codes $\mathcal C$ of kernel dimension $\kappa$ with $9\geq\kappa\geq 5$ obtained via Solov'eva-Phelps doubling construction. Each of the 361 resulting graphs has most of its nonloop edges expressible in terms of the lexicographically disjoint quarters of the products of the components of two of the ten 1-perfect partitions of length 8 classified by Phelps, and loops mostly expressible in terms of the lines of the Fano plane.
No associations
LandOfFree
SQS-graphs of extended 1-perfect codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with SQS-graphs of extended 1-perfect codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and SQS-graphs of extended 1-perfect codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-202382