On the equivalence of linear codes (Q429744): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Dimitris E. Simos / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 94B05 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6048419 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
relative subcode | |||
Property / zbMATH Keywords: relative subcode / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
projective space | |||
Property / zbMATH Keywords: projective space / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
support weight | |||
Property / zbMATH Keywords: support weight / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
relative generalized Hamming weight | |||
Property / zbMATH Keywords: relative generalized Hamming weight / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
monomial transformation | |||
Property / zbMATH Keywords: monomial transformation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
code equivalence | |||
Property / zbMATH Keywords: code equivalence / rank | |||
Normal rank |
Revision as of 23:36, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the equivalence of linear codes |
scientific article |
Statements
On the equivalence of linear codes (English)
0 references
20 June 2012
0 references
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.
0 references
relative subcode
0 references
projective space
0 references
support weight
0 references
relative generalized Hamming weight
0 references
monomial transformation
0 references
code equivalence
0 references