Detection and error capabilities are preserved when applying to a linear code an isomorphism which preserves Hamming distance. We study here two such isomorphisms: permutation isometries and monomial isometrie
Let V be an n-dimensional vector space over a finite field Fq and P = {1, 2,..., n} a poset. We cons...
AbstractThis paper studies and classifies linear transformations that connect Hamming distances of c...
Abstract—We study the decoding of permutation codes ob-tained from distance preserving maps and dist...
Detection and error capabilities are preserved when applying to a linear code an isomorphism which p...
Detection and error capabilities are preserved when applying to a linear code an isomorphism which ...
AbstractIn this note, we consider the notion of simple components of a linear code over the field F ...
The famous MacWilliams Extension Theorem states that for classical codes each linear Hamming isometr...
AbstractMacWilliams' equivalence theorem states that Hamming isometries between linear codes extend ...
<p>Consider any permutation of the elements of a (finite) metric space that preserves a specific dis...
International audienceThe paper deals with the problem of deciding if two finite-dimensional linear ...
International audienceThe paper deals with the problem of deciding if two finite-dimensional linear ...
A linear [n, k] code of length n and dimension k over Fq = GF (q) is a k-dimensional vector subspace...
Isometry classes of linear codes can be described as orbits of gener-ator matrices, as it was shown ...
International audienceThe linear code equivalence problem is to decide whether two linear codes over...
International audienceThe linear code equivalence problem is to decide whether two linear codes over...
Let V be an n-dimensional vector space over a finite field Fq and P = {1, 2,..., n} a poset. We cons...
AbstractThis paper studies and classifies linear transformations that connect Hamming distances of c...
Abstract—We study the decoding of permutation codes ob-tained from distance preserving maps and dist...
Detection and error capabilities are preserved when applying to a linear code an isomorphism which p...
Detection and error capabilities are preserved when applying to a linear code an isomorphism which ...
AbstractIn this note, we consider the notion of simple components of a linear code over the field F ...
The famous MacWilliams Extension Theorem states that for classical codes each linear Hamming isometr...
AbstractMacWilliams' equivalence theorem states that Hamming isometries between linear codes extend ...
<p>Consider any permutation of the elements of a (finite) metric space that preserves a specific dis...
International audienceThe paper deals with the problem of deciding if two finite-dimensional linear ...
International audienceThe paper deals with the problem of deciding if two finite-dimensional linear ...
A linear [n, k] code of length n and dimension k over Fq = GF (q) is a k-dimensional vector subspace...
Isometry classes of linear codes can be described as orbits of gener-ator matrices, as it was shown ...
International audienceThe linear code equivalence problem is to decide whether two linear codes over...
International audienceThe linear code equivalence problem is to decide whether two linear codes over...
Let V be an n-dimensional vector space over a finite field Fq and P = {1, 2,..., n} a poset. We cons...
AbstractThis paper studies and classifies linear transformations that connect Hamming distances of c...
Abstract—We study the decoding of permutation codes ob-tained from distance preserving maps and dist...
DOI
Add to ORKG