Related papers: Rank-Metric Lattices
We provide a geometric characterization of $k$-dimensional $\mathbb{F}_{q^m}$-linear sum-rank metric codes as tuples of $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^k$. We then use this characterization to study one-weight codes in the…
We study $r$-differential posets, a class of combinatorial objects introduced in 1988 by the first author, which gathers together a number of remarkable combinatorial and algebraic properties, and generalizes important examples of ranked…
Sum-rank metric codes are a natural extension of both linear block codes and rank-metric codes. They have several applications in information theory, including multishot network coding and distributed storage systems. The aim of this…
We present the theory of linear rank-metric codes from the point of view of their fundamental parameters. These are: the minimum rank distance, the rank distribution, the maximum rank, the covering radius, and the field size. The focus of…
We are interested in expanding our understanding of symplectic matroids by exploring the properties of a class of symplectic matroids with a "lattice of flats". Taking a well-behaved family of subdivisions of the cross polytope we obtain a…
In the recent years, the notion of rank metric in the context of coding theory has known many interesting developments in terms of applications such as space time coding, network coding or public key cryptography. These applications raised…
Geometric lattices are characterized in this paper as those finite, atomic lattices such that every atom ordering induces a lexicographic shelling given by an edge labeling known as a minimal labeling. Equivalently, geometric lattices are…
A matroid has been one of the most important combinatorial structures since it was introduced by Whitney as an abstraction of linear independence. As an important property of a matroid, it can be characterized by several different (but…
Over fields of characteristic unequal to $2$, we can identify symmetric matrices with homogeneous polynomials of degree $2$. This allows us to view symmetric rank-metric codes as living inside the space of such polynomials. In this paper,…
One-weight codes, in which all nonzero codewords share the same weight, form a highly structured class of linear codes with deep connections to finite geometry. While their classification is well understood in the Hamming and rank metrics -…
Rank-metric codes, defined as sets of matrices over a finite field with the rank distance, have gained significant attention due to their applications in network coding and connections to diverse mathematical areas. Initially studied by…
We obtain algorithmically effective versions of the dense lattice sphere packings constructed from orders in $\mathbb{Q}$-division rings by the first author. The lattices in question are lifts of suitable codes from prime characteristic to…
We establish a connection between Drinfeld modules and rank-metric codes, focusing on the case of semifield codes. Our method constructs rank-metric codes from linear subspaces of endomorphisms of a Drinfeld module acting on torsion…
In this paper we study properties and invariants of matrix codes endowed with the rank metric, and relate them to the covering radius. We introduce new tools for the analysis of rank-metric codes, such as puncturing and shortening…
Lattices induced by coverings arise naturally in matroid theory and combinatorial optimization, providing a structured framework for analyzing relationships between independent sets and closures. In this paper, we explore the structural…
A graph is called Rank-Ramsey if (i) Its clique number is small, and (ii) The adjacency matrix of its complement has small rank. We initiate a systematic study of such graphs. Our main motivation is that their constructions, as well as…
In this paper, we investigate geometrical properties of the rank metric space and covering properties of rank metric codes. We first establish an analytical expression for the intersection of two balls with rank radii, and then derive an…
This paper investigates packing and covering properties of codes with the rank metric. First, we investigate packing properties of rank metric codes. Then, we study sphere covering properties of rank metric codes, derive bounds on their…
It is well-known that the dimension of optimal anticodes in the rank-metric is divisible by the maximum m between the number of rows and columns of the matrices. Moreover, for a fixed k divisible by m, optimal rank-metric anticodes are the…
Dowling constructed Dowling lattice Qn(G), for any finite set with n elements and any finite multiplicative group G of order m, which is a finite geometric lattice. He also defined the Whitney numbers of the first and second kinds for any…