TY - JOUR
T1 - Families of completely transitive codes and distance transitive graphs
AU - Borges, J.
AU - Rifà, J.
AU - Zinoviev, V. A.
PY - 2014/6/6
Y1 - 2014/6/6
N2 - In a previous work, the authors found new families of linear binary completely regular codes with covering radius ρ, where ρâ̂ ̂{3,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. © 2014 Elsevier B.V. All rights reserved.
AB - In a previous work, the authors found new families of linear binary completely regular codes with covering radius ρ, where ρâ̂ ̂{3,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. © 2014 Elsevier B.V. All rights reserved.
KW - Completely regular codes
KW - Completely transitive codes
KW - Distance regular graphs
KW - Distance transitive graphs
UR - https://ddd.uab.cat/record/142866
U2 - https://doi.org/10.1016/j.disc.2014.02.008
DO - https://doi.org/10.1016/j.disc.2014.02.008
M3 - Article
VL - 324
SP - 68
EP - 71
JO - Discrete Mathematics
JF - Discrete Mathematics
SN - 0012-365X
ER -