Bounds on the minimum support weights

DOI10.1109/18.370144zbMath0842.94021OpenAlexW2162013214MaRDI QIDQ4838668

Vladimir I. Levenshtein, Tor Helleseth, Øyvind Ytrehus, Torleiv Kløve

Publication date: 12 July 1995

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.370144

zbMATH Keywords

linear codesboundssupport weight

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Related Items (11)

Code constructions and existence bounds for relative generalized Hamming weight ⋮ Moments of the support weight distribution of linear codes ⋮ Generalizations of the Griesmer bound ⋮ On the relative profiles of a linear code and a subcode ⋮ Radon transforms and packings ⋮ Higher weights for ternary and quaternary self-dual codes* ⋮ Decomposable subspaces, linear sections of Grassmann varieties, and higher weights of Grassmann codes ⋮ Theory of supports for linear codes endowed with the sum-rank metric ⋮ On linear codes over \(\mathbb Z_2\) ⋮ Matrix characterization of linear codes with arbitrary Hamming weight hierarchy ⋮ Codes for Distributed Storage

This page was built for publication: Bounds on the minimum support weights