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 3 is called a binary cubic code. The scope of this paper is to investigate the structural properties of binary cubic codes. Let C be a binary cubic [n,k] code. In this paper, we prove that if n≥ 30 and C has permutation automorphism group of order three, then k≥ 6. Additionally, we show that if n < 30 and k≤ 4, then the permutation automorphism group of C 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] code under the assumption that it is cubic.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…