Generalized Hamming weights of three classes of linear codes

DOI10.1016/J.FFA.2017.01.001MaRDI QIDQ2396766zbMATH OpenOpenAlexFDO

Authors Gaopeng Jian, Hongfeng Wu, Rongquan Feng

Publication date 24 May 2017

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

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

zbMATH Keywords

linear codesGauss periodsgeneralized Hamming weights

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Exponential sums (11T23) Cyclotomy (11T22)

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).

Recommendations

• Generalized Hamming weights for linear codes
• Generalized Hamming weights of linear codes from cryptographic functions
• On the generalized Hamming weights of several classes of cyclic cods
• On generalized Hamming weights of some linear codes
• Generalized Hamming weights of linear codes

Cites work

• A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
• A note on generalized Hamming weights of BCH(2)
• Cyclotomic Linear Codes of Order $3$
• Dimension/length profiles and trellis complexity of linear block codes
• Generalized Hamming Weights of Irreducible Cyclic Codes
• Generalized Hamming Weights of Melas Codes and Dual Melas Codes
• Generalized Hamming weights for linear codes
• Generalized Hamming weights of q-ary Reed-Muller codes
• Generalized Hamming weights of trace codes
• Geometric approach to higher weights
• Linear Codes From Some 2-Designs
• List decoding from erasures: bounds and code constructions
• Network Generalized Hamming Weight
• On Generalized Hamming Weights and the Covering Radius of Linear Codes
• On generalized Hamming weights of BCH codes
• On generalized Hamming weights of binary primitive BCH codes with minimum distance one less than a power of two
• On the generalized Hamming weights of cyclic codes
• On the generalized Hamming weights of geometric Goppa codes
• On the generalized Hamming weights of several classes of cyclic cods
• On the weight hierarchy of geometric Goppa codes
• Period polynomials and Gauss sums for finite fields
• Secure Network Coding for Wiretap Networks of Type II
• The Weight Hierarchy of Hermitian Codes
• The second generalized Hamming weight for two-point codes on a Hermitian curve
• The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\)
• The weight distribution of linear codes over \(GF(q^l)\) having generator matrix over \(GF(q)\)
• The weight hierarchy of higher dimensional Hermitian codes
• The weight hierarchy of the Kasami codes

Cited in

(12)

• GHWs of codes derived from the incidence matrices of some graphs
• Weight distributions and weight hierarchies of two classes of binary linear codes
• Weight distributions and weight hierarchies of a class of binary linear codes with a few weights
• On the third greedy weight of 4-dimensional codes
• Weight hierarchies of a family of linear codes associated with degenerate quadratic forms
• Weight distributions and weight hierarchies of a family of \(p\)-ary linear codes
• Further results on higher weights of codes over finite rings
• Generalized Hamming weights of linear codes from cryptographic functions
• Higher weights and near-MDR codes over chain rings
• The weight hierarchies of linear codes from simplicial complexes
• GHWs of codes arising from Cartesian product of graphs
• A class of cyclotomic linear codes and their generalized Hamming weights

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)