2000 character limit reached
Classification of a family of completely transitive codes
Published 2 Aug 2012 in math.CO, cs.IT, and math.IT | (1208.0393v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.