Related papers: Degenerate flag varieties in network coding
In this paper, we develop a geometric framework for matrix rank-metric codes based on generator tensors and their slice spaces. To every nondegenerate matrix rank-metric code, we associate two systems, which translate metric properties of…
Flag codes are a class of multishot network codes comprising sequences of nested subspaces (flags) within the vector space $\mathbb{F}_q^n$, where $q$ is a prime power. In this paper, we propose a family of constructions for full flag codes…
The rank metric measures the distance between two matrices by the rank of their difference. Codes designed for the rank metric have attracted considerable attention in recent years, reinforced by network coding and further motivated by a…
Tensor codes are a generalisation of matrix codes. Such codes are defined as subspaces of order-r tensors for which the ambient space is endowed with the tensor-rank as a metric. A class of these codes was introduced by Roth, who also…
A class of linear block codes which simultaneously generalizes Gabidulin codes and a class of skew cyclic codes is defined. For these codes, both a Hartmann-Tzeng-like bound and a Roos-like bound, with respect to their rank distance, are…
Rank-metric codes were studied by E. Gabidulin in 1985 after a brief introduction by Delsarte in 1978 as an equivalent of Reed-Solomon codes, but based on linearized polynomials. They have found applications in many areas, including linear…
In this article, we investigate the decoding of the rank metric Reed--Muller codes introduced by Augot, Couvreur, Lavauzelle and Neri in 2021. These codes are defined from Abelian Galois extensions extending the construction of Gabidulin…
Coding schemes with extremely low computational complexity are required for particular applications, such as wireless body area networks, in which case both very high data accuracy and very low power-consumption are required features. In…
Linear network coding transmits information in terms of a basis of a vector space and the information is received as a basis of a possible altered vectorspace. Ralf Koetter and Frank R. Kschischang in Coding for errors and erasures in…
Graphs or networks are a very convenient way to represent data with lots of interaction. Recently, Machine Learning on Graph data has gained a lot of traction. In particular, vertex classification and missing edge detection have very…
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…
In this paper, convolutional network coding is formulated by means of matrix power series representation of the local encoding kernel (LEK) matrices and global encoding kernel (GEK) matrices to establish its theoretical fundamentals for…
We show that certain homological regularity properties of graded connected algebras, such as being AS-Gorenstein or AS-Cohen-Macaulay, can be tested by passing to associated graded rings. In the spirit of noncommutative algebraic geometry,…
We consider the PBW filtrations over the integers of the irreducible highest weight modules in type A and C. We show that the associated graded modules can be realized as Demazure modules for group schemes of the same type and doubled rank.…
A flag is a sequence of nested subspaces of a given ambient space F_q^n over a finite field F_q. In network coding, a flag code is a set of flags, all of them with the same sequence of dimensions, the type vector. In this paper, we…
This paper introduces a two-parameter deformation of the cohomology of generalized flag varieties. One special case is the Belkale-Kumar deformation (used to study eigencones of Lie groups). Another picks out intersections of Schubert…
The classical Ehresmann-Bruhat order describes the possible degenerations of a pair of flags in a linear space V under linear transformations of V; or equivalently, it describes the closure of an orbit of GL(V) acting diagonally on the…
Network coding is a highly efficient data dissemination mechanism for wireless networks. Since network coded information can only be recovered after delivering a sufficient number of coded packets, the resulting decoding delay can become…
In this paper, we present a coding-theoretic framework for message transmission over packet-switched networks. Network is modeled as a channel which can induce packet errors, deletions, insertions, and out of order delivery of packets. The…
Many machine learning methods look for low-dimensional representations of the data. The underlying subspace can be estimated by first choosing a dimension $q$ and then optimizing a certain objective function over the space of…