On extremely transitive extended perfect codes
George K. Guskov, F. I. Solov’eva · Journal of Applied and Industrial Mathematics · 2014
We prove that, for every n = 2 k with k ≥ 4, there exist nonequivalent extremely transitive extended perfect codes. A transitive extended perfect code we call extremely transitive if the perfect code obtained from this code by puncturing any coordinate position is not transitive. The classification is given for all extended perfect codes of length 16.