LinCode – computer classification of linear codes

12/19/2019
by   Sascha Kurz, et al.
0

We present an algorithm for the classification of linear codes over finite fields, based on lattice point enumeration. We validate a correct implementation of our algorithm with known classification results from the literature, which we partially extend to larger ranges of parameters.

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
07/24/2019

Classification of linear codes using canonical augmentation

We propose an algorithm for classification of linear codes over differen...
research
04/09/2018

Implementing Line-Hermitian Grassmann codes

In [I. Cardinali and L. Giuzzi. Line Hermitian Grassmann codes and their...
research
09/28/2021

The q-ary antiprimitive BCH codes

It is well-known that cyclic codes have efficient encoding and decoding ...
research
09/15/2021

On Characterization of Finite Geometric Distributive Lattices

A Lattice is a partially ordered set where both least upper bound and gr...
research
01/11/2020

Partially symmetric monomial codes

A framework of monomial codes is considered, which includes linear codes...
research
02/28/2022

On Codes and Learning With Errors over Function Fields

It is a long standing open problem to find search to decision reductions...

Please sign up or login with your details

Forgot password? Click here to reset