C O ] 1 9 M ay 2 0 0 9 SQS-graphs of Solov ’ eva-Phelps codes

Abstract

A binary extended 1-perfect code C folds over its kernel via the Steiner quadruple systems associated with its codewords. The resulting folding, proposed as a graph invariant for C, distinguishes among the 361 nonlinear codes C of kernel dimension κ obtained via Solov’eva-Phelps doubling construction, where 9 ≥ κ ≥ 5. Each of the 361 resulting graphs has… (More)

Topics

  • Presentations referencing similar topics