The relative generalized Hamming weight and the semilinear equivalence of codes
From MaRDI portal
Publication:415955
DOI10.1007/S11432-010-4143-1zbMATH Open1237.94127OpenAlexW1973497928MaRDI QIDQ415955FDOQ415955
Publication date: 9 May 2012
Published in: Science China Information Sciences (Search for Journal in Brave)
Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-010-4143-1
Cites Work
- The weight hierarchies of q-ary codes of dimension 4
- Generalized Hamming weights for linear codes
- Some New Characters on the Wire-Tap Channel of Type II
- The relative generalized Hamming weight of linear \(q\)-ary codes and their subcodes
- Wire-Tap Channel II
- Generalized Hamming weights and semilinear equivalence of codes
Cited In (7)
- New code equivalence based on relative generalized Hamming weights
- The equivalence of linear codes implies semi-linear equivalence
- On the relative generalized Hamming weights of a 4-dimensional linear code and a subcode with dimension one
- Relative generalized Hamming weights of affine Cartesian codes
- On the Relative Generalized Hamming Weights of Linear Codes and their Subcodes
- Relative generalized Hamming weights and extended weight polynomials of almost affine codes
- The relative generalized Hamming weight of linear \(q\)-ary codes and their subcodes
This page was built for publication: The relative generalized Hamming weight and the semilinear equivalence of codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415955)