The weight hierarchy of decreasing norm-trace codes

Abstract

The Generalized Hamming weights and their relative version, which generalize the minimum distance of a linear code, are relevant to numerous applications, including coding on the wire-tap channel of type II, $t$-resilient functions, bounding the cardinality of the output in list decoding algorithms, ramp secret sharing schemes, and quantum error correction. The generalized Hamming weights have been determined for some families of codes, including Cartesian codes and Hermitian one-point codes. In this paper, we determine the generalized Hamming weights of decreasing norm-trace codes, which are linear codes defined by evaluating monomials that are closed under divisibility on the rational points of the extended norm-trace curve given by $x^{u} = y^{q^{s - 1}} + y^{q^{s - 2}} + \cdots + y$ over the finite field of cardinality $q^s$, where $u$ is a positive divisor of $\frac{q^s - 1}{q - 1}$. As a particular case, we obtain the weight hierarchy of one-point norm-trace codes and recover the result of Barbero and Munuera (2001) giving the weight hierarchy of one-point Hermitian codes. We also study the relative generalized Hamming weights for these codes and use them to construct impure quantum codes with excellent parameters.

Figures (1)

• Figure 1: Example of the decomposition of the footprint used in the proof of Lemma \ref{['lemafootprint']} with $r=3$.

Theorems & Definitions (30)

• Definition 2.1
• Theorem 2.2: (Monotonicity)
• Corollary 2.3: (Generalized Singleton Bound)
• Theorem 2.4: (Duality)
• Lemma 2.5
• Remark 2.6
• Lemma 3.1
• proof
• Theorem 3.2
• proof