TY - JOUR
T1 - On a family of binary completely transitive codes with growing covering radius
AU - Rifà, Josep
AU - Zinoviev, Victor A.
PY - 2014/3/6
Y1 - 2014/3/6
N2 - A new family of binary linear completely transitive (and, therefore, completely regular) codes is constructed. The covering radius of these codes is growing with the length of the code. In particular, for any integer ρ≥2, there exist two codes with d=3, covering radius ρ and length (4ρ2) and (4ρ+22), respectively. These new completely transitive codes induce, as coset graphs, a family of distance-transitive graphs of growing diameter. © 2013 Elsevier B.V. All rights reserved.
AB - A new family of binary linear completely transitive (and, therefore, completely regular) codes is constructed. The covering radius of these codes is growing with the length of the code. In particular, for any integer ρ≥2, there exist two codes with d=3, covering radius ρ and length (4ρ2) and (4ρ+22), respectively. These new completely transitive codes induce, as coset graphs, a family of distance-transitive graphs of growing diameter. © 2013 Elsevier B.V. All rights reserved.
KW - Combinatorial codes
KW - Completely regular codes
KW - Completely transitive codes
KW - Distance-transitive graphs
U2 - 10.1016/j.disc.2013.11.009
DO - 10.1016/j.disc.2013.11.009
M3 - Article
SN - 0012-365X
VL - 318
SP - 48
EP - 52
JO - Discrete Mathematics
JF - Discrete Mathematics
IS - 1
ER -