Classification of linear codes using canonical augmentation

07/24/2019
by   Iliya Bouyukliev, et al.
0

We propose an algorithm for classification of linear codes over different finite fields based on canonical augmentation. We apply this algorithm to obtain classification results over fields with 2, 3 and 4 elements.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/18/2020

Computer classification of linear codes

We present algorithms for classification of linear codes over finite fie...
research
12/19/2019

LinCode – computer classification of linear codes

We present an algorithm for the classification of linear codes over fini...
research
08/21/2021

A subfield-based construction of optimal linear codes over finite fields

In this paper, we construct four families of linear codes over finite fi...
research
03/19/2019

On Z2Z4-additive complementary dual codes and related LCD codes

Linear complementary dual codes were defined by Massey in 1992, and were...
research
08/23/2023

Fast Exact NPN Classification with Influence-aided Canonical Form

NPN classification has many applications in the synthesis and verificati...
research
12/08/2022

Linear and group perfect codes over skew fields and quasi skew fields

In this paper, we propose a general construction of linear perfect codes...
research
08/31/2022

Recategorising research: Mapping from FoR 2008 to FoR 2020 in Dimensions

In 2020 the Australia New Zealand Standard Research Classification Field...

Please sign up or login with your details

Forgot password? Click here to reset