visitant ::
identificació
|
|||||||||||||||
Cerca | Lliura | Ajuda | Servei de Biblioteques | Sobre el DDD | Català English Español |
Pàgina inicial > Articles > Articles publicats > Families of completely transitive codes and distance transitive graphs |
Data: | 2014 |
Resum: | 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. |
Ajuts: | Ministerio de Ciencia e Innovación TIN2013-40524 Agència de Gestió d'Ajuts Universitaris i de Recerca 2009/SGR-1224 |
Drets: | Tots els drets reservats. |
Llengua: | Anglès |
Document: | Article ; recerca ; Versió acceptada per publicar |
Matèria: | Completely regular codes ; Completely transitive codes ; Distance regular graphs ; Distance transitive graphs |
Publicat a: | Discrete Mathematics, Vol. 324 (June 2014) , p. 68-71, ISSN 0012-365X |
Post-print 10 p, 634.2 KB |