STS-graphs of perfect codes mod kernel (Q556834)

A perfect 1-error correcting code is a subset of \(n\) dimensional binary space with \(2^{n-r}\) elements such that every element in the ambient space is Hamming distance 1 or 0 from a unique element in the code. The kernel of a code consists of those vectors \(v\) whose coset of the code \(v+C\) is the code itself. The ambient space can be viewed as a simple graph with vertex set \(\{0,1\}^n\) where the edges connect those vertices which differ in one coordinate. The authors use this setting to show that a perfect 1-error correcting code is foldable over its kernel via the Steiner triple system associated to its codewords. They use this to define a new graph invariant of the code. They show that this invariant is complete for Vasil'ev code of length 15. They use these results to distinguish two classes of nonadditive proprelinear codes, one of nonlinear Vasil'ev additive codes, one of non-proprelinear weakly proprelinear codes, and two of nonprelinear homogeneous codes. They prove the existence of nonadditive proprelinear 1-perfect codes and generalize proprelinear codes by extending the associated composition to a more general product.