SQS-graphs of Solov'eva-Phelps codes

Details SQS-graphs of Solov'eva-Phelps codes SQS-graphs of Solov'eva-Phelps codes

2009-05-19

arxiv.org/abs/0905.3178v1

Mathematics

Combinatorics

14 pages, 15 tables

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$ obtained via Solov'eva-Phelps doubling construction, where $9\geq\kappa\geq 5$. Each of the 361 resulting graphs has most of its nonloop edges expressible in terms of lexicographically ordered quarters of products of classes from extended 1-perfect partitions of length 8 (as classified by Phelps) and loops mostly expressible in terms of the lines of the Fano plane.

Affiliated with

Also associated with

No associations

Rating

SQS-graphs of Solov'eva-Phelps 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 Solov'eva-Phelps codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and SQS-graphs of Solov'eva-Phelps codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-241885