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 proposed a technique that, exploiting a simply computed invariant, allows us to reduce the computational complexity of the classification process. 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.

Classification of linear codes exploiting an invariant

MARCUGINI, Stefano;MILANI, Alfredo;PAMBIANCO, Fernanda
2006

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 proposed a technique that, exploiting a simply computed invariant, allows us to reduce the computational complexity of the classification process. 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.
2006
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11391/173534
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact