Back to Search
Start Over
On new infinite families of completely regular and completely transitive codes.
- Source :
-
Discrete Mathematics . Apr2024, Vol. 347 Issue 4, pN.PAG-N.PAG. 1p. - Publication Year :
- 2024
-
Abstract
- 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. [ABSTRACT FROM AUTHOR]
- Subjects :
- *AUTOMORPHISM groups
*GROBNER bases
*BINARY codes
Subjects
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 347
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 175392383
- Full Text :
- https://doi.org/10.1016/j.disc.2023.113840