GHWs of codes derived from the incidence matrices of some graphs
From MaRDI portal
Publication:2158535
Cites work
- A lower bound on the weight hierarchies of product codes.
- A note on the generalized Hamming weights of Reed-Muller codes
- Codes associated with triangular graphs and permutation decoding
- Codes from incidence matrices and line graphs of Hamming graphs
- Codes from incidence matrices and line graphs of Paley graphs
- Codes from incidence matrices of graphs
- Codes from the incidence matrices and line graphs of Hamming graphs H^k(n,2) for k 2
- Error-correcting codes from graphs
- Generalized Hamming Weights for Almost Affine Codes
- Generalized Hamming weights for linear codes
- Generalized Hamming weights of affine Cartesian codes
- Generalized Hamming Weights of Irreducible Cyclic Codes
- Generalized Hamming weights of projective Reed-Muller-type codes over graphs
- Generalized Hamming weights of q-ary Reed-Muller codes
- Generalized Hamming weights of three classes of linear codes
- Generalized Hamming weights of trace codes
- Geometric approach to higher weights
- Hamming weights in irreducible cyclic codes
- Linear codes over signed graphs
- On the generalized Hamming weights of product codes
- On the generalized Hamming weights of several classes of cyclic cods
- The second generalized Hamming weight of certain Castle codes
- The weight distribution of irreducible cyclic codes with block lengths n₁ ((q^-1)/N)
- The weight hierarchies of the projective codes from nondegenerate quadrics
- The Weight Hierarchy of Some Reducible Cyclic Codes
Cited in
(4)
This page was built for publication: GHWs of codes derived from the incidence matrices of some graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2158535)