New code equivalence based on relative generalized Hamming weights
MetadataShow full item record
Code equivalence is a basic concept in coding theory. The well-known theorem by MacWilliams gives a sufficient condition for code equivalence. Recently the MacWilliams theorem has been generalized, by Fan, Liu and Puig, making use of the generalized Hamming weights (GHWs). In this paper, we will present a further generalization of the MacWilliams theorem. Our result extends both the MacWilliams theorem and the result by Fan, Liu and Puig. We will first define ''relative subcodes'' of a linear code, based on the relative generalized Hamming weights (RGHWs) which is a generalization of the GHWs; and then establish a method based on finite projective geometry to characterize relative subcodes. Using this method, we will prove our main result.
Copyright 2011 Elsevier. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. Please refer to the journal's website for access to the definitive, published version.
Coding and Information Theory