Divisible linear rank metric codes
Olga Polverino, Paolo Santonastaso, John Sheekey, Ferdinando Zullo

TL;DR
This paper investigates whether all matrix subspaces with ranks divisible by a certain number originate from larger field matrices, providing conditions for when this is true and presenting counterexamples.
Contribution
It characterizes when divisible rank metric codes can be derived from larger fields and constructs counterexamples where this is not possible.
Findings
Identifies cases where divisible codes originate from larger fields
Constructs counterexamples of divisible codes not arising from larger fields
Provides criteria for the existence of such codes
Abstract
A subspace of matrices over can be naturally embedded as a subspace of matrices in with the property that the rank of any of its matrix is a multiple of . It is quite natural to ask whether or not all subspaces of matrices with such a property arise from a subspace of matrices over a larger field. In this paper we explore this question, which corresponds to studying divisible codes in the rank metric. We determine some cases for which this question holds true, and describe counterexamples by constructing subspaces with this property which do not arise from a subspace of matrices over a larger field.
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 · Cooperative Communication and Network Coding · Advanced Wireless Network Optimization
