Generalized Hamming weights of three classes of linear codes

From MaRDI portal
Publication:2396766

DOI10.1016/J.FFA.2017.01.001zbMATH Open1403.94107arXiv1612.09390OpenAlexW2569763494MaRDI QIDQ2396766FDOQ2396766


Authors: Gaopeng Jian, Hongfeng Wu, Rongquan Feng Edit this on Wikidata


Publication date: 24 May 2017

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Abstract: The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the generalized Hamming weights of three classes of linear codes constructed through defining sets and determine them partly for some cases. Particularly, in the semiprimitive case we solve an problem left in Yang et al. (IEEE Trans. Inf. Theory 61(9): 4905--4913, 2015).


Full work available at URL: https://arxiv.org/abs/1612.09390




Recommendations




Cites Work


Cited In (12)





This page was built for publication: Generalized Hamming weights of three classes of linear codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2396766)