On Generalized Hamming Weights and the Covering Radius of Linear Codes
From MaRDI portal
Publication:5386116
DOI10.1007/978-3-540-77224-8_40zbMath1195.94079OpenAlexW1487897143MaRDI QIDQ5386116
Arbind Kumar Lal, Heeralal Janwa
Publication date: 17 April 2008
Published in: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77224-8_40
covering radiusGriesmer boundchain conditioncyclic codesoptimal codesgeneralized Griesmer boundGeneralized Hamming weights
Related Items (3)
Higher Hamming weights for locally recoverable codes on algebraic curves ⋮ Generalized Hamming weights of three classes of linear codes ⋮ Relative generalized Hamming weights of cyclic codes
This page was built for publication: On Generalized Hamming Weights and the Covering Radius of Linear Codes