English

On the permutation automorphisms of binary cubic codes

Information Theory 2026-01-07 v3 math.IT

Abstract

A binary linear code whose permutation automorphism group has a fixed point free permutation of order 33 is called a binary cubic code. The scope of this paper is to investigate the structural properties of binary cubic codes. Let CC be a binary cubic [n,k][n,k] code. In this paper, we prove that if n30n\geq 30 and CC has permutation automorphism group of order three, then k6k\geq 6. Additionally, we show that if n<30n < 30 and k4k\leq 4, then the permutation automorphism group of CC 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 [72,36,16][72,36,16] 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

R2 v1 2026-06-28T14:50:41.390Z