Generalized weights: an anticode approach
Alberto Ravagnani

TL;DR
This paper introduces Delsarte generalized weights as a new algebraic invariant for rank-metric codes, extending the theory of generalized rank weights and providing duality and optimality characterizations.
Contribution
It defines Delsarte generalized weights based on optimal anticodes, refines existing rank weight concepts, and establishes duality and optimal code characterizations.
Findings
Delsarte generalized weights refine existing rank weights for Gabidulin codes.
Characterization of Delsarte optimal codes and anticodes via generalized weights.
Duality theory shows weights of a code determine those of its dual.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · graph theory and CDMA systems
