Related papers: Equivalence for flag codes
We first discuss the problems in the theory of ordinary differential equations that gave rise to the concept of a flag system and illustrate these with the Cartan criterion for Monge equations (1st order) as well as the Cartan statement…
A strong blocking set in a finite projective space is a set of points that intersects each hyperplane in a spanning set. We provide a new graph theoretic construction of such sets: combining constant-degree expanders with asymptotically…
We consider some questions related to codes constructed using various graphs, in particular focusing on graphs which are not lattices in two or three dimensions. We begin by considering Floquet codes which can be constructed using…
In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of…
We compute the quantum cohomology rings of the partial flag manifolds F_{n_1\cdots n_k}=U(n)/(U(n_1)\times \cdots \times U(n_k)). The inductive computation uses the idea of Givental and Kim. Also we define a notion of the vertical quantum…
In the present paper, we show that if the dimension of an arbitrary algebraic geometry code over a finite field of even characters is slightly less than half of its length, then it is equivalent to an Euclidean self-orthogonal code.…
We investigate the structural relationship between prefix-free codes over the binary alphabet and a class of unlabeled rooted trees, which we call \emph{symmetric} trees. We establish a canonical correspondence between prefix-free codes and…
Building upon the application of flags to network coding introduced by Liebhold, Nebe, and Vazquez-Castro, we develop a variant of this coding technique that uses degenerate flags. The information set is a metric affine space isometric to…
Cyclic codes are among the most important families of codes in coding theory for both theoretical and practical reasons. Despite their prominence and intensive research on cyclic codes for over a half century, there are still open problems…
The index coding problem is studied from an interference alignment perspective, providing new results as well as new insights into, and generalizations of, previously known results. An equivalence is established between multiple unicast…
Flag domains are open orbits of real forms $G_\mathbb{R}$ of complex reductive Lie supergroups $G$ in $G$-flag supermanifolds $Z = G/P$. This thesis discusses three topics from the theory of these flag domains: 1. Measurability(i.e.…
Fibonacci codes are self-synchronizing variable-length codes that are proven useful for their robustness and compression capability. Asymptotically, these codes provide better compression efficiency as the order of the underlying Fibonacci…
As a natural extension of the theory of uniform vector bundles on Fano manifolds, we consider uniform principal bundles, and study them by means of the associated flag bundles, as their natural projective geometric realizations. In this…
We show that every flag variety contains a naturally defined homogeneous cominuscule subvariety. From the Dynkin diagram of the flag variety, we compute the Dynkin diagram of that subvariety.
In this paper, we construct new families of flag-transitive linear spaces with $q^{2n}$ points and $q^{2}$ points on each line that admit a one-dimensional affine automorphism group. We achieve this by building a natural connection with…
A group code structure of a linear code is a description of the code as one-sided or two-sided ideal of a group algebra of a finite group. In these realizations, the group algebra is identified with the ambient space, and the group elements…
We study subvarieties of the flag variety called Hessenberg varieties, defined by certain linear conditions. These subvarieties arise naturally in applications including geometric representation theory, number theory, and numerical…
We give the class of finite groups which arise as the permutation groups of cyclic codes over finite fields. Furthermore, we extend the results of Brand and Huffman et al. and we find the properties of the set of permutations by which two…
By exploiting the connection between scattered $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^3$ and minimal non degenerate $3$-dimensional rank metric codes of $\mathbb{F}_{q^m}^{n}$, $n \geq m+2$, described in [2], we will exhibit a new…
Matching Logic is a framework for specifying programming language semantics and reasoning about programs. Its formulas are called patterns and are built with variables, symbols, connectives and quantifiers. A pattern is a combination of…