On the permutation automorphisms of binary cubic codes
Abstract
A binary linear code whose permutation automorphism group has a fixed point free permutation of order is called a binary cubic code. The scope of this paper is to investigate the structural properties of binary cubic codes. Let be a binary cubic code. In this paper, we prove that if and has permutation automorphism group of order three, then . Additionally, we show that if and , then the permutation automorphism group of has order greater than three. Moreover, along the way, we provide some results on the structure of the higher dimensional cubic codes. In particular, we present some results concerning the structure of the putative extremal self-dual code under the assumption that it is cubic.
Keywords
Cite
@article{arxiv.2402.10667,
title = {On the permutation automorphisms of binary cubic codes},
author = {Murat Altunbulak and Fatma Altunbulak Aksu and Roghayeh Hafezieh and İpek Tuvay},
journal= {arXiv preprint arXiv:2402.10667},
year = {2026}
}
Comments
17 pages, a new section about hihger dimensional cubic codes is added