Involutory permutation automorphisms of binary linear codes

07/30/2022
by   Fatma Altunbulak Aksu, et al.
0

We investigate the properties of binary linear codes of even length whose permutation automorphism group is a cyclic group generated by an involution. Up to dimension or co-dimension 4, we show that there is no quasi group code whose permutation automorphism group is isomorphic to C_2. By generalizing the method we use to prove this result, we obtain results on the structure of putative extremal self-dual [72, 36, 16] and [96, 48, 20] codes in the presence of an involutory permutation automorphism.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/15/2019

Permutation codes over finite fields

In this paper we describe a class of codes called permutation codes. Th...
research
12/19/2019

On the algebraic structure of quasi group codes

In this note, an intrinsic description of some families of linear codes ...
research
09/28/2022

On abelian and cyclic group codes

We determine a condition on the minimum Hamming weight of some special a...
research
08/22/2022

Construction of binary linear constant weight codes by symmetric differences of supports

We give a construction for the binary linear constant weight codes by us...
research
01/25/2019

New Lower Bounds for Permutation Codes using Linear Block Codes

In this paper we prove new lower bounds for the maximal size of permutat...
research
09/11/2023

Neural Discovery of Permutation Subgroups

We consider the problem of discovering subgroup H of permutation group S...
research
09/17/2020

Coordinate transitivity of extended perfect codes and their SQS

We continue the study of the class of binary extended perfect propelinea...

Please sign up or login with your details

Forgot password? Click here to reset