Related papers: Bases for Riemann--Roch spaces of linearized funct…
Given any linear code $C$ over a finite field $GF(q)$ we show how $C$ can be described in a transparent and geometrical way by using the associated Bruen-Silverman code. Then, specializing to the case of MDS codes we use our new approach to…
In this paper, we propose and study $r$-minimal codes, a natural extension of minimal codes which have been extensively studied with respect to Hamming metric, rank metric and sum-rank metric. We first propose $r$-minimal codes in a general…
The Grassmann manifold of linear subspaces is important for the mathematical modelling of a multitude of applications, ranging from problems in machine learning, computer vision and image processing to low-rank matrix optimization problems,…
Our aim is to reprove the basic results of the theory of branches of plane algebraic curves over algebraically closed fields of arbitrary characteristic. We do not use the Hamburger-Noether expansions. Our basic tool is the logarithmic…
In this paper we will estimate the main parameters of some evaluation codes which are known as projective parameterized codes. We will find the length of these codes and we will give a formula for the dimension in terms of the Hilbert…
For applications in algebraic geometric codes, an explicit description of bases of Riemann-Roch spaces of divisors on function fields over finite fields is needed. We investigate the third function field $ F^{(3)} $ in a tower of…
We describe a new class of list decodable codes based on Galois extensions of function fields and present a list decoding algorithm. These codes are obtained as a result of folding the set of rational places of a function field using…
Toric codes are evaluation codes obtained from an integral convex polytope $P \subset \R^n$ and finite field $\F_q$. They are, in a sense, a natural extension of Reed-Solomon codes, and have been studied recently by J. Hansen and D. Joyner.…
Extending work of M. Zarzar, we evaluate the potential of Goppa-type evaluation codes constructed from linear systems on projective algebraic surfaces with small Picard number. Putting this condition on the Picard number provides some…
Linear codes play a central role in coding theory and have applications in several branches of mathematics. For error correction purposes the minimum Hamming distance should be as large as possible. Linear codes related to applications in…
We develop a global cohomology theory for number fields by offering topological cohomology groups, an arithmetical duality, a Riemann-Roch type theorem, and two types of vanishing theorem. As applications, we study moduli spaces of…
We construct explicitly Pad\'e approximations of the second kind for a special class of G-functions. These are then applied to prove a Baker-type lower bound for linear forms in the p-adic values of these functions. Moreover, we consider…
We revisit and extend the connections between $\mathbb{F}_{q^m}$-linear rank-metric codes and evasive $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^k$. We give a unifying framework in which we prove in an elementary way how the parameters…
The moduli spaces of compact and connected Riemann surfaces has been a central topic in modern mathematics in recent years. Thus their homological dimensions become important invariants. Motivated by the emergence mathematical counterparts…
In this paper, we consider minimal linear codes in a general construction of linear codes from q-ary functions. First, we give the sufficient and necessary condition for codewords to be minimal. Second, as an application, we present four…
We study properties of rank metric and codes in rank metric over finite fields. We show that in rank metric perfect codes do not exist. We derive an existence bound that is the equivalent of the Gilbert--Varshamov bound in Hamming metric.…
Motivated by an application to database linear querying, such as private information-retrieval protocols, we suggest a fundamental property of linear codes -- the generalized covering radius. The generalized covering-radius hierarchy of a…
This work introduces a reduced order modeling (ROM) framework for the solution of parameterized second-order linear elliptic partial differential equations formulated on unfitted geometries. The goal is to construct efficient…
The newest model for space-time is based on sub-Riemannian geometry. In this paper, we use a combination of Lorentzian and sub-Riemannian geometry, the suggest a new model which likes to its ancestors, but with the most efficient in…
Riemannian geometry is a mathematical field which has been the cornerstone of revolutionary scientific discoveries such as the theory of general relativity. Despite early uses in robot design and recent applications for exploiting data with…