Families of completely transitive codes and distance transitive graphs

J. Borges; J. Rifà; V. A. Zinoviev

doi:https://doi.org/10.1016/j.disc.2014.02.008

Families of completely transitive codes and distance transitive graphs

J. Borges, J. Rifà, V. A. Zinoviev

Research output: Contribution to journal › Article › Research › peer-review

5 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	68-71
Journal	Discrete Mathematics
Volume	324
DOIs	https://doi.org/10.1016/j.disc.2014.02.008
Publication status	Published - 6 Jun 2014

Keywords

Completely regular codes
Completely transitive codes
Distance regular graphs
Distance transitive graphs

Access to Document

https://doi.org/10.1016/j.disc.2014.02.008

https://ddd.uab.cat/record/142866

Cite this

@article{5701b4973e7b4bc3b6078ab9d58d68c4,

title = "Families of completely transitive codes and distance transitive graphs",

abstract = "In a previous work, the authors found new families of linear binary completely regular codes with covering radius ρ, where ρ{\^a}̂{\^ }{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. {\textcopyright} 2014 Elsevier B.V. All rights reserved.",

keywords = "Completely regular codes, Completely transitive codes, Distance regular graphs, Distance transitive graphs",

author = "J. Borges and J. Rif{\`a} and Zinoviev, {V. A.}",

year = "2014",

month = jun,

day = "6",

doi = "https://doi.org/10.1016/j.disc.2014.02.008",

language = "English",

volume = "324",

pages = "68--71",

journal = "Discrete Mathematics",

issn = "0012-365X",

}

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

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 -

Families of completely transitive codes and distance transitive graphs

Abstract

Keywords

Access to Document

Fingerprint

Cite this