Generalized Hamming Weights for Almost Affine Codes
From MaRDI portal
Publication:5280876
Abstract: We define generalized Hamming weights for almost affine codes. We show how various aspects and applications of generalized Hamming weights for linear codes, such as Wei duality, generalized Kung's bound, profiles, connection to wire-tap channels of type II, apply to the larger class of almost affine codes in general. In addition we discuss duality of almost affine codes,and of the smaller class of multilinear codes. We also give results about weight distributions of infinite series of almost affine codes, each series obtained from a fixed code by extending the code alphabet.
Recommendations
- Generalized Hamming weights of affine Cartesian codes
- Relative generalized Hamming weights and extended weight polynomials of almost affine codes
- Generalized Hamming weights and equivalences of codes
- Generalized Hamming weights and some parameterized codes
- Relative generalized Hamming weights of affine Cartesian codes
- Generalized Hamming weights for linear codes
- Generalized Hamming weights and semilinear equivalence of codes
- Generalized Hamming weights of linear codes
- scientific article; zbMATH DE number 2077101
- On generalized Hamming weights of some linear codes
Cited in
(28)- Relative profiles and extended weight polynomials of almost affine codes
- Generalized Anticodes in Hamming Spaces
- Linear codes over signed graphs
- Class of generalized Goppa codes perfect in weighted Hamming metric
- Generalized minimum distance functions
- Critical problem for codes over finite chain rings
- New code equivalence based on relative generalized Hamming weights
- The second generalized Hamming weight of some evaluation codes arising from a projective torus
- Weight spectra of Gabidulin rank-metric codes and Betti numbers
- GHWs of codes arising from Cartesian product of graphs
- GHWs of codes derived from the incidence matrices of some graphs
- Flags of almost affine codes and the two-party wire-TAP channel of type II
- Generalized Hamming weights of projective Reed-Muller-type codes over graphs
- Evaluation codes and their basic parameters
- Improvements on generalized Hamming weights of some trace codes
- On the structure of matroids arising from the gain graphs
- Indicator functions, \(\mathrm{v}\)-numbers and Gorenstein rings in the theory of projective Reed-Muller-type codes
- Generalized Hamming weights of trace codes
- On the third greedy weight of 4-dimensional codes
- Wei-type duality theorems for rank metric codes
- Relative generalized Hamming weights of affine Cartesian codes
- Generalized Hamming weights of codes on multi-dimensional quadrics
- Computing generalized hamming weights of binary linear codes via free resolutions
- Relative generalized Hamming weights and extended weight polynomials of almost affine codes
- Generalized Hamming weights of toric codes over hypersimplices and squarefree affine evaluation codes
- Generalized Hamming weights of codes over the \(\mathcal{GH}\) curve
- Bounds for generalized Hamming weights of general AG codes
- On the generalized Hamming weights of product codes
This page was built for publication: Generalized Hamming Weights for Almost Affine Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280876)
