Rank-Metric Codes, Generalized Binomial Moments and their Zeta Functions
Eimear Byrne, Giuseppe Cotardo, Alberto Ravagnani

TL;DR
This paper introduces a new class of extremal rank-metric codes called i-BMD codes, explores their properties, and establishes connections with zeta functions and MacWilliams identities, advancing the theoretical understanding of rank-metric code invariants.
Contribution
It defines i-BMD codes, relates their invariants to code parameters, and extends the theory of rank-metric codes with new identities and zeta function connections.
Findings
i-BMD codes are a proper subclass of i-MRD codes
Established a relation between generalized rank weight enumerator and zeta functions
Proved a MacWilliams identity for generalized rank weight distributions
Abstract
In this paper we introduce a new class of extremal codes, namely the -BMD codes. We show that for this family several of the invariants are determined by the parameters of the underlying code. We refine and extend the notion of an -MRD code and show that the -BMD codes form a proper subclass of the -MRD codes. Using the class of -BMD codes we then obtain a relation between the generalized rank weight enumerator and its corresponding generalized zeta function. We also establish a MacWilliams identity for generalized rank weight distributions.
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.
