Classification of a family of completely transitive codes
From MaRDI portal
Publication:6234793
arXiv1208.0393MaRDI QIDQ6234793FDOQ6234793
Authors: Neil I. Gillespie, Michael Giudici, Cheryl E. Praeger 
Publication date: 1 August 2012
Abstract: The completely regular codes in Hamming graphs have a high degree of combinatorial symmetry and have attracted a lot of interest since their introduction in 1973 by Delsarte. This paper studies the subfamily of completely transitive codes, those in which an automorphism group is transitive on each part of the distance partition. This family is a natural generalisation of the binary completely transitive codes introduced by Sole in 1990. We take the first step towards a classification of these codes, determining those for which the automorphism group is faithful on entries.
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Linear codes (general theory) (94B05)
This page was built for publication: Classification of a family of completely transitive codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6234793)
