On the Relative Generalized Hamming Weights of Linear Codes and their Subcodes
From MaRDI portal
Recommendations
- The relative generalized Hamming weight of linear \(q\)-ary codes and their subcodes
- On generalized Hamming weights of some linear codes
- The relative generalized Hamming weight and the semilinear equivalence of codes
- Generalized Hamming weights of linear codes
- On the relative generalized Hamming weights of a 4-dimensional linear code and a subcode with dimension one
- Generalized Hamming weights for linear codes
- Generalized Hamming weights and semilinear equivalence of codes
- Code constructions and existence bounds for relative generalized Hamming weight
- On Generalized Hamming Weights and the Covering Radius of Linear Codes
Cited in
(15)- The relative generalized Hamming weight of linear \(q\)-ary codes and their subcodes
- Relative generalized Hamming weights and extended weight polynomials of almost affine codes
- Further results on higher weights of codes over finite rings
- Relative one-weight linear codes
- On relative constant-weight codes
- On the relative generalized Hamming weights of a 4-dimensional linear code and a subcode with dimension one
- The geometric structure of relative one-weight codes
- On generalized Hamming weights of some linear codes
- Code constructions and existence bounds for relative generalized Hamming weight
- Generalized Hamming weights of nonlinear codes and the relation to the Z/sub 4/-linear representation
- Geometric approach to higher weights
- A property of the relative subcodes
- scientific article; zbMATH DE number 7691472 (Why is no real title available?)
- Relative generalized Hamming weights of evaluation codes
- Further results on support weights of certain subcodes
This page was built for publication: On the Relative Generalized Hamming Weights of Linear Codes and their Subcodes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3013127)