Related papers: Schubert Subspace Codes
A constant-dimension code (CDC) is a set of subspaces of constant dimension in a common vector space with upper bounded pairwise intersection. We improve and generalize two constructions for CDCs, the improved linkage construction and the…
We study the local and global intersection cohomology of the intersection of two Schubert varieties in a flag manifold. In this version some new references are added.
For each $A\in\N^n$ we define a Schubert variety $\sh_A$ as a closure of the $\Slt(\C[t])$-orbit in the projectivization of the fusion product $M^A$. We clarify the connection of the geometry of the Schubert varieties with an algebraic…
The regular subspaces of a Dirichlet form are the regular Dirichlet forms that inherit the original form but possess smaller domains. The two problems we are concerned are: (1) the existence of regular subspaces of a fixed Dirichlet form,…
We present new bounds on the existence of general quantum maximum distance separable codes (QMDS): the length $n$ of all QMDS codes with local dimension $D$ and distance $d \geq 3$ is bounded by $n \leq D^2 + d - 2$. We obtain their weight…
Lifted maximum rank distance (MRD) codes, which are constant dimension codes, are considered. It is shown that a lifted MRD code can be represented in such a way that it forms a block design known as a transversal design. A slightly…
The brain encodes spacial structure through a combinatorial code of neural activity. Experiments suggest such codes correspond to convex areas of the subject's environment. We present an intrinsic condition that implies a neural code may…
A major difficulty in quantum computation is the ability to implement fault tolerant computations, protecting information against undesired interactions with the environment. Stabiliser codes were introduced as a means to protect…
A code is said to be equidistant if the distance between any two distinct codewords of the code is the same. In this paper, we have studied equidistant single-orbit cyclic and quasi-cyclic subspace codes. The orbit code generated by a…
Subspace varieties are algebraic varieties whose elements are tensors with bounded multilinear rank. In this paper, we compute their degrees by computing their volumes.
The surface code is a two-dimensional topological code with code parameters that scale optimally with the number of physical qubits, under the constraint of two-dimensional locality. In three spatial dimensions an analogous simple yet…
We show that, for vector spaces in which distance measurement is performed using a gauge, the existence of best coapproximations in $1$-codimensional closed linear subspaces implies in dimensions $\geq 2$ that the gauge is a norm, and in…
There are many results on the minimum distance of a cyclic code of the form that if a certain set T is a subset of the defining set of the code, then the minimum distance of the code is greater than some integer t. This includes the BCH,…
In this work we investigate unions of lifted MRD codes of a fixed dimension and minimum distance and derive an explicit formula for the cardinality of such codes. This will then imply a lower bound on the cardinality of constant dimension…
It is shown that the maximum size of a binary subspace code of packet length $v=6$, minimum subspace distance $d=4$, and constant dimension $k=3$ is $M=77$; in Finite Geometry terms, the maximum number of planes in $\operatorname{PG}(5,2)$…
We illuminate the relation between the Bruhat order on the symmetric group and structure constants (Littlewood-Richardson coefficients) for the cohomology of the flag manifold in terms of its basis of Schubert classes. Equivalently, the…
Construction of subspace codes with good parameters is one of the most important problems in random network coding. In this paper we present first a generalization of the concept of cyclic subspaces codes and further we show that the usual…
We study a family of subvarieties of the flag variety defined by certain linear conditions, called Hessenberg varieties. We compare them to Schubert varieties. We prove that some Schubert varieties can be realized as Hessenberg varieties…
Horospherical Schubert varieties are determined. It is shown that the stabilizer of an arbitrary point in a Schubert variety is a strongly solvable algebraic group. The connectedness of this stabilizer subgroup is discussed. Moreover, a new…
Quantum convolutional codes can be used to protect a sequence of qubits of arbitrary length against decoherence. We introduce two new families of quantum convolutional codes. Our construction is based on an algebraic method which allows to…