On new infinite families of completely regular and completely transitive codes
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 n...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2024 |
| País: | España |
| Institución: | Universitat Autònoma de Barcelona |
| Repositorio: | Dipòsit Digital de Documents de la UAB |
| Idioma: | inglés |
| OAI Identifier: | oai:ddd.uab.cat:287795 |
| Acceso en línea: | https://ddd.uab.cat/record/287795 https://dx.doi.org/urn:doi:10.1016/j.disc.2023.113840 |
| Access Level: | acceso abierto |
| Palabra clave: | Completely regular codes Completely transitive codes Automorphism groups |
| Sumario: | 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. |
|---|