Generalized Hamming Weights for Almost Affine Codes
From MaRDI portal
Publication:5280876
DOI10.1109/TIT.2017.2654456zbMath1366.94598arXiv1601.01504MaRDI QIDQ5280876
Trygve Johnsen, Hugues Verdure
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.01504
Related Items (14)
The second generalized Hamming weight of some evaluation codes arising from a projective torus ⋮ GHWs of codes arising from Cartesian product of graphs ⋮ Flags of almost affine codes and the two-party wire-TAP channel of type II ⋮ GHWs of codes derived from the incidence matrices of some graphs ⋮ On the structure of matroids arising from the gain graphs ⋮ Weight spectra of Gabidulin rank-metric codes and Betti numbers ⋮ Evaluation codes and their basic parameters ⋮ Critical problem for codes over finite chain rings ⋮ Generalized minimum distance functions ⋮ Generalized Hamming weights of projective Reed-Muller-type codes over graphs ⋮ Linear codes over signed graphs ⋮ On the third greedy weight of 4-dimensional codes ⋮ Relative profiles and extended weight polynomials of almost affine codes ⋮ Wei-type duality theorems for rank metric codes
This page was built for publication: Generalized Hamming Weights for Almost Affine Codes
