TY - JOUR
T1 - On new infinite families of completely regular and completely transitive codes
AU - Borges, J. (Joaquim)
AU - Rifà i Coma, Josep
AU - Zinoviev, Victor
N1 - Publisher Copyright:
© 2023 The Author(s)
PY - 2024/4
Y1 - 2024/4
N2 - In two previous papers we constructed new families of completely regular codes by concatenation methods. Here we determine cases in which the new codes are completely transitive. For these cases we also find the automorphism groups of such codes. For the remaining cases, we show that the codes are not completely transitive assuming an upper bound on the order of the monomial automorphism groups, according to computational results.
AB - In two previous papers we constructed new families of completely regular codes by concatenation methods. Here we determine cases in which the new codes are completely transitive. For these cases we also find the automorphism groups of such codes. For the remaining cases, we show that the codes are not completely transitive assuming an upper bound on the order of the monomial automorphism groups, according to computational results.
KW - Completely regular codes
KW - Completely transitive codes
KW - Automorphism groups
UR - http://www.scopus.com/inward/record.url?scp=85179922558&partnerID=8YFLogxK
UR - https://www.mendeley.com/catalogue/76f7da56-9934-3540-b34c-7fd120326357/
U2 - 10.1016/j.disc.2023.113840
DO - 10.1016/j.disc.2023.113840
M3 - Article
SN - 0012-365X
VL - 347
JO - Discrete Mathematics
JF - Discrete Mathematics
IS - 4
M1 - 113840
ER -