On the equivalence of linear codes
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.
- An elementary proof of the MacWilliams theorem on equivalence of codes
- Characters and the equivalence of codes
- Error-correcting codes: An axiomatic approach
- Generalized Hamming weights and equivalences of codes
- Generalized Hamming weights for linear codes
- scientific article; zbMATH DE number 2109875 (Why is no real title available?)
- Some New Characters on the Wire-Tap Channel of Type II
- The relative generalized Hamming weight of linear \(q\)-ary codes and their subcodes
- The weight hierarchies of q-ary codes of dimension 4
- Edge local complementation and equivalence of binary linear codes
- Note sur la notion d'équivalence entre deux codes linéaires
- Characters and the equivalence of codes
- On the characterization of linear uniquely decodable codes
- The equivalence of linear codes implies semi-linear equivalence
- Further results on the semilinear equivalence of linear codes
- On the asymptotic number of non-equivalent \(q\)-ary linear codes.
- Equivalence of linear codes with the same weight enumerator
- scientific article; zbMATH DE number 1498796 (Why is no real title available?)
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- Isometries of the Hamming Space and Equivalence Relations of Linear Codes Over a Finite Field
- The hardness of code equivalence over F_q and its application to code-based cryptography
- Computing an invariant of a linear code
- Maximum intersection of linear codes and codes equivalent to linear
- Generalized Hamming weights and semilinear equivalence of codes
- About the code equivalence
- On the equivalence of linear cyclic and constacyclic codes
- Generalized Hamming weights and equivalences of codes
- On linear rigidity of a class of codes
This page was built for publication: On the equivalence of linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429744)
