Generalized Hamming weights of three classes of linear codes

December 30, 2016 Β· Declared Dead Β· πŸ› Finite Fields Their Appl.

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Gaopeng Jian arXiv ID 1612.09390 Category cs.IT: Information Theory Citations 37 Venue Finite Fields Their Appl. Last Checked 6 months ago
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).
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted