Related papers: Bases for Riemann--Roch spaces of linearized funct…
This paper is a general survey of literature on Goppa-type codes from higher dimensional algebraic varieties. The construction and several techniques for estimating the minimum distance are described first. Codes from various classes of…
In this paper we exploit the concept of extended Pareto grid to study the geometric properties of the matching distance for $\mathbb{R}^2$-valued regular functions defined on a Riemannian closed manifold. In particular, we prove that in…
We generalize the classical de Rham decomposition theorem for Riemannian manifolds to the setting of geodesic metric spaces of finite dimension.
In this manuscript, we consider decoding Grassmann codes, linear codes associated to Grassmannian of planes in an affine space. We look at the orbit structure of Grassmannian arising from the natural action of multiplicative group of…
Let C be a projective curve defined over a field k and let D be a divisor of C. The Riemann-Roch space L(D) is the set of rational functions on C for which certain zeros are imposed and certain poles are allowed, with some multiplicities…
We prove a new bound for the minimum distance of geometric Goppa codes that generalizes two previous improved bounds. We include examples of the bound to one and two point codes over both the Suzuki and Hermitian curves.
We study the differential properties of generalized arc schemes, and geometric versions of Kolchin's Irreducibility Theorem over arbitrary base fields. As an intermediate step, we prove an approximation result for arcs by algebraic curves.
In this article, the minimum distance of the dual $C^{\bot}$ of a functional code $C$ on an arbitrary dimensional variety $X$ over a finite field $\F_q$ is studied. The approach consists in finding minimal configurations of points on $X$…
Affine Grassmann codes are a variant of generalized Reed-Muller codes and are closely related to Grassmann codes. These codes were introduced in a recent work [2]. Here we consider, more generally, affine Grassmann codes of a given level.…
Recently, Baker and Norine {Advances in Mathematics, 215(2): 766-788, 2007} found new analogies between graphs and Riemann surfaces by developing a Riemann-Roch machinery on a finite graph $G$. In this paper, we develop a general…
The purpose of the present article is the study of duals of functional codes on algebraic surfaces. We give a direct geometrical description of them, using differentials. Even if this geometrical description is less trivial, it can be…
This is an introduction to the geometry of compact Riemann surfaces, largely following the books Farkas-Kra, Fay, Mumford Tata lectures. 1) Defining Riemann surfaces with atlases of charts, and as locus of solutions of algebraic equations.…
Using the Riemann Hypothesis over finite fields and bounds for the size of spherical codes, we give explicit upper bounds, of polynomial size with respect to the size of the field, for the number of geometric isomorphism classes of…
Rank-metric codes, defined as sets of matrices over a finite field with the rank distance, have gained significant attention due to their applications in network coding and connections to diverse mathematical areas. Initially studied by…
We present a new bound for the minimum distance of a general primary linear code. For affine variety codes defined from generalised C_{ab} curves the new bound often improves dramatically on the Feng-Rao bound for primary codes. The method…
The present paper is a natural continuation of our previous paper: "Teleparallel Lagrange geometry and a unified field theory, Class. Quantum Grav., 27 (2010), 045005 (29pp)" \cite{WNA}. In this paper, we apply a linearization scheme on the…
We introduce an approach of Riemann--Roch theorem to the boundedness problem of minimal log discrepancies in fixed dimension. After reducing it to the case of a Gorenstein terminal singularity, firstly we prove that its minimal log…
In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also prove a new inductive bound for the minimum distance of generalized toric codes. As…
Riemann surfaces are among the simplest and most basic geometric objects. They appear as key players in many branches of physics, mathematics, and other sciences. Despite their widespread significance, how to compute distances between pairs…
Upper bounds are derived for codes in Stiefel and Grassmann manifolds with given minimal chordal distance. They stem from upper bounds for codes in products of unit spheres and projective spaces. The new bounds are asymptotically better…