Classification of linear codes exploiting an invariant

Authors

  • Stefano Marcugini
  • Alfredo Milani
  • Fernanda Pambianco

DOI:

https://doi.org/10.11575/cdm.v1i1.61901

Abstract

We consider the problem of computing the equivalence classes of a set of linear codes. This problem arises when new codes are obtained extending codes of lower dimension. We propose a technique that, exploiting an invariant simple to compute, allows to reduce the computational complexity of the classification process. Using this technique the [13,5,8]_7, the [14,5,9]_8 and the [15,4,11]_9 codes have been classified. These classifications enabled us to solve the packing problem for NMDS codes for q=7,8,9. The same technique can be applied to the problem of the classification of other structures.

Downloads

Published

2006-03-24

Issue

Section

Articles