On new infinite families of completely regular and completely transitive codes
From MaRDI portal
Publication:6197705
DOI10.1016/J.DISC.2023.113840arXiv2303.11190MaRDI QIDQ6197705FDOQ6197705
Authors: J. Borges, Josep Rifà, Victor A. Zinoviev 
Publication date: 19 February 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2303.11190
Recommendations
- One-relator groups and the lower central series. II: Invariants of one- relator groups
- scientific article; zbMATH DE number 5167093
- Matching as the Intersection of Matroids
- scientific article; zbMATH DE number 4098692
- Lectures on injective modules and quotient rings
- scientific article; zbMATH DE number 3280343
- scientific article; zbMATH DE number 3212179
- scientific article; zbMATH DE number 3156637
- A stochastic treatment of a control system with breakdown and repair
Cites Work
- The Magma algebra system. I: The user language
- Title not available (Why is that?)
- Completely regular codes
- The Geometry of Two-Weight Codes
- Title not available (Why is that?)
- Completely transitive codes in Hamming graphs
- Distance-regular graphs
- Completely regular codes and completely transitive codes
- Title not available (Why is that?)
- About non equivalent completely regular codes with identical intersection array
- Completely regular codes by concatenating Hamming codes
- On completely regular codes
- On the classification of binary completely transitive codes with almost-simple top-group
- On completely regular and completely transitive supplementary codes
This page was built for publication: On new infinite families of completely regular and completely transitive codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6197705)
