q-Polymatroids associated with restricted rank-metric codes
Eimear Byrne, Giovanni Longobardi, and Rocco Trombetti

TL;DR
This paper investigates q-polymatroids derived from restricted rank-metric codes, characterizing their rank functions and highlighting differences from unrestricted matrix code polymatroids.
Contribution
It provides a characterization of the rank functions of q-polymatroids associated with restricted rank-metric codes and identifies conditions for their determination.
Findings
Characterization of rank functions for restricted rank-metric code polymatroids
Identification of conditions for full determination of these rank functions
Differences observed compared to unrestricted matrix code q-polymatroids
Abstract
In this article, we study polymatroids that are representable by means of linear restricted rank-metric codes, namely, by subspaces of the space of alternating, symmetric, or Hermitian square matrices endowed with the rank metric. More precisely, we characterize the rank function defining these polymatroids and establish sufficient conditions on the relevant parameters under which it is fully determined. We show that there are several differences in compared to the behaviour of -polymatroids of unrestricted matrix codes.
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
Topicsgraph theory and CDMA systems · Advanced Topics in Algebra · Graph Labeling and Dimension Problems
