On the Structure of the Linear Codes with a Given Automorphism

09/11/2023
by   Stefka Bouyuklieva, et al.
0

The purpose of this paper is to present the structure of the linear codes over a finite field with q elements that have a permutation automorphism of order m. These codes can be considered as generalized quasi-cyclic codes. Quasi-cyclic codes and almost quasi-cyclic codes are discussed in detail, presenting necessary and sufficient conditions for which linear codes with such an automorphism are self-orthogonal, self-dual, or linear complementary dual.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/05/2022

Self-dual 2-quasi-cyclic Codes and Dihedral Codes

We characterize the structure of 2-quasi-cyclic codes over a finite fiel...
research
01/03/2023

On Euclidean, Hermitian and symplectic quasi-cyclic complementary dual codes

Linear complementary dual codes (LCD) are codes that intersect trivially...
research
07/03/2018

The Concatenated Structure of Quasi-Abelian Codes

The decomposition of a quasi-abelian code into shorter linear codes over...
research
12/29/2022

Symplectic self-orthogonal quasi-cyclic codes

In this paper, we obtain necessary and sufficient conditions for quasi-c...
research
03/23/2022

On generalized quasi-cyclic codes over ℤ_4

Based on good algebraic structures and practicabilities, generalized qua...
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
08/09/2019

Cyclic Oritatami Systems Cannot Fold Infinite Fractal Curves

RNA cotranscriptional folding is the phenomenon in which an RNA transcri...

Please sign up or login with your details

Forgot password? Click here to reset