On new infinite families of completely regular and completely transitive codes

DOI10.1016/J.DISC.2023.113840MaRDI QIDQ6197705zbMATH OpenFDO

Authors J. Borges, Josep Rifà, Victor A. Zinoviev

Publication date 19 February 2024

Published in Discrete Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2303.11190

zbMATH Keywords

automorphism groupscompletely transitive codescompletely regular codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

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.

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

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3497777 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• About non equivalent completely regular codes with identical intersection array
• Completely regular codes
• Completely regular codes and completely transitive codes
• Completely regular codes by concatenating Hamming codes
• Completely transitive codes in Hamming graphs
• Distance-regular graphs
• On completely regular and completely transitive supplementary codes
• On completely regular codes
• On the classification of binary completely transitive codes with almost-simple top-group
• The Geometry of Two-Weight Codes
• The Magma algebra system. I: The user language

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)