Generalized weights: an anticode approach
From MaRDI portal
Abstract: In this paper we study generalized weights as an algebraic invariant of a code. We first describe anticodes in the Hamming and in the rank metric, proving in particular that optimal anticodes in the rank metric coincide with Frobenius-closed spaces. Then we characterize both generalized Hamming and rank weights of a code in terms of the intersection of the code with optimal anticodes in the respective metrics. Inspired by this description, we propose a new algebraic invariant, which we call "Delsarte generalized weights", for Delsarte rank-metric codes based on optimal anticodes of matrices. We show that our invariant refines the generalized rank weights for Gabidulin codes proposed by Kurihara, Matsumoto and Uyematsu, and establish a series of properties of Delsarte generalized weights. In particular, we characterize Delsarte optimal codes and anticodes in terms of their generalized weights. We also present a duality theory for the new algebraic invariant, proving that the Delsarte generalized weights of a code completely determine the Delsarte generalized weights of the dual code. Our results extend the theory of generalized rank weights for Gabidulin codes. Finally, we prove the analogue for Gabidulin codes of a theorem of Wei, proving that their generalized rank weights characterize the worst-case security drops of a Gabidulin rank-metric code.
Recommendations
Cites work
- Bilinear forms over a finite field, with applications to coding theory
- Coding for Errors and Erasures in Random Network Coding
- Galois invariance, trace codes and subfield subcodes
- Generalized Hamming weights for linear codes
- Generalized rank weights: A duality statement
- On Metrics for Error Correction in Network Coding
- Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
- The classification of large spaces of matrices with bounded rank
- Theory of codes with maximum rank distance
- Universal Secure Network Coding via Rank-Metric Codes
- Wire-Tap Channel II
Cited in
(23)- A polymatroid approach to generalized weights of rank metric codes
- Theory of supports for linear codes endowed with the sum-rank metric
- Linear cutting blocking sets and minimal codes in the rank metric
- Rank-metric codes, generalized binomial moments and their zeta functions
- Weight spectra of Gabidulin rank-metric codes and Betti numbers
- Wei-type duality theorems for rank metric codes
- Rank-metric codes and \(q\)-polymatroids
- \(q\)-polymatroids and their relation to rank-metric codes
- On dually almost MRD codes
- On the generalised rank weights of quasi-cyclic codes
- Weight distribution of rank-metric codes
- Rank-metric lattices
- Quasi optimal anticodes: structure and invariants
- New MRD codes from linear cutting blocking sets
- On defining generalized rank weights
- A geometric approach to rank metric codes and a classification of constant weight codes
- Subspace codes from Ferrers diagrams
- Evasive subspaces, generalized rank weights and near MRD codes
- Tensor Codes and Their Invariants
- Rank-metric codes and their duality theory
- Anticodes in the sum-rank metric
- Tensor representation of rank-metric codes
- Zeta functions for tensor codes
This page was built for publication: Generalized weights: an anticode approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q899568)
