Related papers: Affine Hermitian Grassmann Codes
We propose an adaptive tracking algorithm where the object is modelled as a continuously updated bag of affine subspaces, with each subspace constructed from the object's appearance over several consecutive frames. In contrast to linear…
The setting of projective systems can be used to study the parameters of a projective linear code $\mathcal{C}$. This can be done by considering the intersections of the point set $\Omega$ defined by the columns of a generating matrix for…
We introduce the concepts of complex Grassmannian codes and designs. Let G(m,n) denote the set of m-dimensional subspaces of C^n: then a code is a finite subset of G(m,n) in which few distances occur, while a design is a finite subset of…
The finite Grassmannian $\mathcal{G}_{q}(k,n)$ is defined as the set of all $k$-dimensional subspaces of the ambient space $\mathbb{F}_{q}^{n}$. Subsets of the finite Grassmannian are called constant dimension codes and have recently found…
We introduce various affine Grassmannians, study their geometric properties, and give some applications. We also discuss the geometric Satake equivalence. These are the expanded lecture notes for a mini-course in 2015 PCMI summer school.…
Linear codes have been an interesting subject of study for many years, as linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, a class of…
We show herein that a pattern based on FGLM techniques can be used for computing Gr\"obner bases, or related structures, associated to linear codes. This Gr\"obner bases setting turns out to be strongly related to the combinatorics of the…
We describe isometric embeddings of polar Grassmann graphs formed by non-maximal singular subspaces. In almost all cases, they are induced by collinearity preserving injections of polar spaces. As a simple consequence of this result, we get…
Geometrical properties of holonomic and non holonomic varieties defined by the Pfaff equations connected with a first order systems of differential equations are studied. The Riemann extensions of affine connected spaces for investigation…
We use filtrations of the Grassmannian model to produce explicit algebraic formulae for all harmonic maps of finite uniton number from a Riemann surface, and so all harmonic maps from the 2-sphere, to the unitary group for a general class…
We consider the problem of determining Gr\"obner bases of binomial ideals associated with linear error correcting codes. Computation of Gr\"obner bases of linear codes have become a topic of interest to many researchers in coding theory…
In this paper we study the algebraic-geometry of any one-point code on the Hermitian curve. Moreover, we characterize the minimum-weight codewords of some of their dual codes and describe many their small-weight codewords.
Linear codes have been an interesting topic in both theory and practice for many years. In this paper, a class of $q$-ary linear codes with few weights are presented and their weight distributions are determined using Gauss periods. Some of…
We introduce a class of maps from an affine flat into a Riemannian manifold that solve an elliptic system defined by the natural second order elliptic operator of the affine structure and the nonlinear Riemann geometry of the target. These…
We reformulate a recently introduced interpolation-based unique decoding algorithm of algebraic geometry codes using the theory of Gr\"obner bases of modules on the coordinate ring of the base curve. With the same decoding performance, the…
In coding theory, constructing codes with good parameters is one of the most important and fundamental problems. Though a great many of good codes have been produced, most of them are defined over alphabets of sizes equal to prime powers.…
Linear codes with few weights have been an interesting subject of study for many years, as these codes have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, linear codes…
Finding affine parameters for null geodesics is often of considerable physical importance, especially when studying the paths swept out by null geodesics or when dealing with conservation laws and/or averaged energy conditions. But…
AG codes correspond geometrically to points in the Grassmannian of k-planes in an n-dimensional projective space PG(n, F_q) defined over a finite field F_q of q elements. We prove that invariant subgrassmannians by the action of a triangle…
In this paper, we study the Grassmannian of n-dimensional subspaces of a 2n-dimensional vector space and its infinite-dimensional analogues. Such a Grassmannian can be endowed with two binary relations (adjacent and distant), with pencils…