Corpus ID: 51977323

Classification of a family of completely transitive codes

@article{Gillespie2012ClassificationOA,
  title={Classification of a family of completely transitive codes},
  author={Neil I. Gillespie and Michael Giudici and C. Praeger},
  journal={ArXiv},
  year={2012},
  volume={abs/1208.0393}
}
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… Expand

Topics from this paper

CHARACTERISATION OF A FAMILY OF NEIGHBOUR TRANSITIVE CODES
Distance-regular graphs
Entry-faithful 2-neighbour transitive codes
A note on binary completely regular codes with large minimum distance

References

SHOWING 1-10 OF 19 REFERENCES
Completely regular codes and completely transitive codes
  • P. Solé
  • Computer Science, Mathematics
  • Discret. Math.
  • 1990
Neighbour transitivity on codes in Hamming graphs
Nonexistence of completely transitive codes with error-correcting capability e>3
Uniqueness of certain completely regular Hadamard codes
On the orders of primitive groups
Algorithmic Recognition of Actions of 2-Homogeneous Groups on Pairs
On q-ary linear completely regular codes with ρ=2 and antipodal dual
EMBEDDING PERMUTATION GROUPS INTO WREATH PRODUCTS IN PRODUCT ACTION
On non-antipodal binary completely regular codes
...
1
2
...