On the equivalence of linear codes (Q429744)

The authors consider the problem of equivalence of linear codes, i.e., when they differ by a linear isometry of the Hamming space. In that case, the linear isometry is exactly a monomial transformation. Certain equivalent conditions are derived for this notion of equivalence, based upon properties of the relative codes obtained from the relative generalized Hamming weight (RGHW). The new equivalence condition is realised by an alternative definition of the RGHW, given by the first author et al. in [Des. Codes Cryptography 48, No. 2, 111--123 (2008; Zbl 1178.94229)], and the value function. Possible extensions of this result could be the design of an algorithm for code equivalence based on the established equivalence condition and the relative subcodes of equivalent codes.