Families of completely transitive codes and distance transitive graphs
Borges, Joaquim (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions)
Rifà i Coma, Josep (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions)
Zinoviev, Victor (Kharkevich Institute for Problems of Information Transmission)

Date:	2014
Abstract:	In a previous work, the authors found new families of linear binary completely regular codes with the covering radius ρ = 3 and ρ = 4. In this paper, the automorphism groups of such codes are computed and it is proven that the codes are not only completely regular, but also completely transitive. From these completely transitive codes, in the usual way, i. e. , as coset graphs, new presentations of infinite families of distance transitive coset graphs of diameter three and four, respectively, are constructed.
Grants:	Ministerio de Ciencia e Innovación TIN2013-40524 Agència de Gestió d'Ajuts Universitaris i de Recerca 2009/SGR-1224
Rights:	Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets.
Language:	Anglès
Document:	Article ; recerca ; Versió acceptada per publicar
Subject:	Completely regular codes ; Completely transitive codes ; Distance regular graphs ; Distance transitive graphs
Published in:	Discrete Mathematics, Vol. 324 (June 2014) , p. 68-71, ISSN 0012-365X

DOI: 10.1016/j.disc.2014.02.008

Post-print 10 p, 634.2 KB

The record appears in these collections:
Research literature > UAB research groups literature > Research Centres and Groups (research output) > Engineering > Combinatorics, Coding and Security Group (CCSG)
Articles > Research articles
Articles > Published articles