The relative generalized Hamming weight of linear \(q\)-ary codes and their subcodes
From MaRDI portal
Publication:1009041
DOI10.1007/s10623-008-9170-1zbMath1178.94229MaRDI QIDQ1009041
Yuan Luo, Wende Chen, Zi-Hui Liu
Publication date: 31 March 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-008-9170-1
94B05: Linear codes (general theory)
Related Items
Refined analysis of RGHWs of code pairs coming from Garcia-Stichtenoth's second tower, Relative generalized Hamming weights of evaluation codes, Code constructions and existence bounds for relative generalized Hamming weight, Further improvements on the Feng-Rao bound for dual codes, The relative generalized Hamming weight and the semilinear equivalence of codes, On the equivalence of linear codes, New code equivalence based on relative generalized Hamming weights, On the second relative greedy weight, A property of the relative subcodes, Further results on support weights of certain subcodes, Notes on the value function, Flags of almost affine codes and the two-party wire-TAP channel of type II, Relative generalized Hamming weights of cyclic codes, Relative generalized Hamming weights of affine Cartesian codes, On the relative profiles of a linear code and a subcode, Relative profiles and extended weight polynomials of almost affine codes, Relative generalized Hamming weights of \(q\)-ary Reed-Muller codes, On the relative generalized Hamming weights of a 4-dimensional linear code and a subcode with dimension one
Cites Work
