Related papers: Higher-degree symmetric rank-metric codes

Let K be a field of characteristic different from 2 and let V be a vector space of dimension n over K. Let M be a non-zero subspace of symmetric bilinear forms defined on V x V and let r=rank(M) denote the set of different positive integers…

Let $p$ be a prime such that $p \equiv 2$ or $3$ mod $5$. Linear block codes over the non-commutative matrix ring of $2 \times 2$ matrices over the prime field $GF(p)$ endowed with the Bachoc weight are derived as isometric images of linear…

Principal matrices of a numerical semigroup of embedding dimension n are special types of $n \times n$ matrices over integers of rank $\leq n - 1$. We show that such matrices and even the pseudo principal matrices of size n must have rank…

Low-rank parity-check (LRPC) codes are the rank-metric analogue of low-density parity-check codes and they found important applications in code-based cryptography. In this paper we investigate a sub-family of LRPC codes, which have a…

Skew polynomial rings provide a fundamental example of noncommutative principal ideal domains. Special quotients of these rings yield matrix algebras that play a central role in the theory of rank-metric codes. Recent breakthroughs have…

We review the main results of the theory of rank-metric codes, with emphasis on their combinatorial properties. We study their duality theory and MacWilliams identities, comparing in particular rank-metric codes in vector and matrix…

Let M be an irreducible Riemannian symmetric space. The index of M is the minimal codimension of a (non-trivial) totally geodesic submanifold of M. We prove that the index is bounded from below by the rank of the symmetric space. We also…

We consider the problem of finding the smallest rank of a complex matrix whose absolute values of the entries are given. We call this minimum the phaseless rank of the matrix of the entrywise absolute values. In this paper we study this…

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 -…

We introduce a remarkable new family of norms on the space of $n \times n$ complex matrices. These norms arise from the combinatorial properties of symmetric functions, and their construction and validation involve probability theory,…

In this work we develop a geometric approach to the study of rank metric codes. Using this method, we introduce a simpler definition for generalized rank weight of linear codes. We give a complete classification of constant rank weight code…

The large-scale geometry of hyperbolic metric spaces exhibits many distinctive features, such as the stability of quasi-geodesics (the Morse Lemma), the visibility property, and the homeomorphism between visual boundaries induced by a…

We investigate two fundamental questions intersecting coding theory and combinatorial geometry, with emphasis on their connections. These are the problem of computing the asymptotic density of MRD codes in the rank metric, and the Critical…

We show that a totally geodesic submanifold of a symmetric space satisfying certain conditions admits an extension to a minimal submanifold of dimension one higher, and we apply this result to construct new examples of complete embedded…

The fundamental theorem of symmetric polynomials over rings is a classical result which states that every unital commutative ring is fully elementary, i.e. we can express symmetric polynomials with elementary ones in a unique way. The…

Although there is no doubt that multi-parameter persistent homology is a useful tool to analyse multi-variate data, efficient ways to compute these modules are still lacking in the available topological data analysis toolboxes. Other issues…

We give a general lower bound on the rank of matrices of the form $\rho(h) - I$ with $\rho : G \rightarrow GL({\mathbb F}^n)$ an irreducible representation of a finite group $G$. The main tool in the proof is a (strengthening) of a…

Using commutative algebra methods we study the generalized minimum distance function (gmd function) and the corresponding generalized footprint function of a graded ideal in a polynomial ring over a field. The number of solutions that a…

We introduce symmetric arithmetic circuits, i.e. arithmetic circuits with a natural symmetry restriction. In the context of circuits computing polynomials defined on a matrix of variables, such as the determinant or the permanent, the…

We introduce and discuss (local) symmetries of geometric structures. These symmetries generalize the classical (locally) symmetric spaces to various other geometries. Our main tools are homogeneous Cartan geometries and their explicit…