Related papers: Isometry-Dual Flags of AG Codes
Given $\mathbb{F}_q$ the finite field with $q$ elements and an integer $n\geq 2$, a flag is a sequence of nested subspaces of $\mathbb{F}_q^n$ and a flag code is a nonempty set of flags. In this context, the distance between flags is the…
In this paper, we investigate homogeneous Riemannian geometry on real flag manifolds of the split real form of $\mathfrak{g}_2$. We characterize the metrics that are invariant under the action of a maximal compact subgroup of $G_2.$ Our…
We introduce and study the problem \mpd, which asks for two planar graphs $G_1$ and $G_2$ whether $G_1$ can be embedded such that its dual is isomorphic to $G_2$. Our algorithmic main result is an NP-completeness proof for the general case…
An identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its neighbours within the code. We study the edge-identifying code problem, i.e. the identifying code…
A linear code is called an MDS self-dual code if it is both an MDS code and a self-dual code with respect to the Euclidean inner product. The parameters of such codes are completely determined by the code length. In this paper, we consider…
This is a manuscript of a chapter prepared for a book. The good codes possess large information length and large minimum distance. A class of codes is said to be asymptotically good if there exists a positive real $\delta$ such that, for…
Let X be a projective geometrically irreducible non-singular algebraic curve defined over a finite field F of order $q^2$. If the number of F-rational points of X satisfies the Hasse-Weil upper bound, then X is said to be F-maximal. For a…
The hull of a linear code is defined as the intersection of the code and its dual. This concept was initially introduced to classify finite projective planes. The hull plays a crucial role in determining the complexity of algorithms used to…
Many literatures consider the extended Reed-Solomon (RS) codes, including their dual codes and covering radii, but few focus on extended algebraic geometry (AG) codes of genus $g\ge1$. In this paper, we investigate extended AG codes and…
This article describes the geometry of isomorphisms between complements of geometrically irreducible closed curves in the affine plane $\mathbb{A}^2$, over an arbitrary field, which do not extend to an automorphism of $\mathbb{A}^2$. We…
We consider the problem of identifying exactly which AF-algebras are isomorphic to a graph C*-algebra. We prove that any separable, unital, Type I C*-algebra with finitely many ideals is isomorphic to a graph C*-algebra. This result allows…
A connected undirected graph $G = (V,E)$ is lower conformally rigid if uniform edge weights maximize the second smallest Laplacian eigenvalue $\lambda_2(w)$ over all normalized edge weights $w$, and upper conformally rigid if uniform edge…
We investigate several types of linear codes constructed from two families $\tilde{\mathcal S}_q$ and $\tilde{\mathcal R}_q$ of maximal curves over finite fields recently constructed by Skabelund as cyclic covers of the Suzuki and Ree…
We study arithmetical and geometrical properties of {\it maximal curves}, that is, curves defined over the finite field $\mathbb F_{q^2}$ whose number of $\mathbb F_{q^2}$-rational points reachs the Hasse-Weil upper bound. Under a…
We systematically extend the elementary differential and Riemannian geometry of classical $\mathrm{U}(1)$-gauge theory to the noncommutative setting by combining recent advances in noncommutative Riemannian geometry with the theory of…
A Finsler space $(M,F)$ is called flag-wise positively curved, if for any $x\in M$ and any tangent plane $\mathbf{P}\subset T_xM$, we can find a nonzero vector $y\in \mathbf{P}$, such that the flag curvature $K^F(x,y, \mathbf{P})>0$. Though…
Let $X$ be a connected, smooth, and projective curve of genus $g$ over an algebraically closed field of characteristic $p >0$. This paper investigates a characteristic-$p$ analogue of a well-known fact concerning flat vector bundles in…
An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertices of $G$ have distinct closed neighbourhoods within $C$. These codes have been widely studied for over two decades. We give an improvement…
We show that for every positive integer R there exist monomial ideals generated in degree two, with linear syzygies, and regularity of the quotient equal to R. Such examples can not be found among Gorenstein ideals since the regularity of…
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…