Related papers: Coset bounds for algebraic geometric codes
In the present paper, we show that if the dimension of an arbitrary algebraic geometry code over a finite field of even characters is slightly less than half of its length, then it is equivalent to an Euclidean self-orthogonal code.…
This paper is concerned with some Algebraic Geometry codes on Jacobians of genus 2 curves. We derive a lower bound for the minimum distance of these codes from an upper "Weil type" bound for the number of rational points on irreducible…
This paper characterizes Goppa codes of certain maximal curves over finite fields defined by equations of the form $y^n = x^m + x$. We investigate Algebraic Geometric and quantum stabilizer codes associated with these maximal curves and…
In this paper we present a geometrical characterization for the minimum-weight codewords of the Hermitian codes over the fields $\mathbb{F}_{q^2}$ in the third and fourth phase, namely with distance $d \geq q^2-q$. We consider the unique…
We investigate multi-point algebraic geometric codes defined from curves related to the generalized Hermitian curve introduced by Alp Bassa, Peter Beelen, Arnaldo Garcia, and Henning Stichtenoth. Our main result is to find a basis of the…
In this paper, we give an explicit form for the dual of the algebraic geometry code $C_e(a,b)$ defined on an Hirzebruch surface $\mathcal{H}_e$ and parametrized by the divisor $aS_e + bF_e$, where $a,b\in\mathbb{N}$ and $S_e$ and $F_e$…
We prove new bounds on the number of incidences between points and higher degree algebraic curves. The key ingredient is an improved initial bound, which is valid for all fields. Then we apply the polynomial method to obtain global bounds…
Based on a notion by Gray and Kambites of hyperbolicity in the setting of semimetric spaces like digraphs or semigroups, we will construct (under a small additional geometric assumption) a boundary based on quasi-geodesic rays and anti-rays…
The set of all error-correcting codes C over a fixed finite alphabet F of cardinality q determines the set of code points in the unit square with coordinates (R(C), delta (C)):= (relative transmission rate, relative minimal distance). The…
Let G be a numerical semigroup. In this paper, we prove an upper bound for the Betti numbers of the semigroup ring of G which depends only on the width of G, that is, the difference between the largest and the smallest generator of G. In…
Inside the symmetric product of a very general curve, we consider the codimension-one subvarieties of symmetric tuples of points imposing exceptional secant conditions on linear series on the curve of fixed degree and dimension. We compute…
Given an Edwards curve, we determine a basis for the Riemann-Roch space of any divisor whose support does not contain any of the two singular points. This basis allows us to compute a generating matrix for an algebraic-geometric Goppa code…
In this article, we propose a geometric programming method in order to compute lower bounds for real polynomials. We provide new sufficient conditions for polynomials to be nonnegative as well as to have a sum of binomial squares…
We prove that the height of any algebraic computation tree for deciding membership in a semialgebraic set is bounded from below (up to a multiplicative constant) by the logarithm of m-th Betti number (with respect to singular homology) of…
In the field of algebraic geometric codes (AG codes), the characterization of dual codes has long been a challenging problem which relies on differentials. In this paper, we provide some descriptions for certain differentials utilizing…
Upper bounds are given for the weight distribution of binary weakly self-dual codes. To get these new bounds, we introduce a novel method of utilizing unitary operations on Hilbert spaces. This method is motivated by recent progress on…
We show that the order dimension of the weak order on a Coxeter group of type A, B or D is equal to the rank of the Coxeter group, and give bounds on the order dimensions for the other finite types. This result arises from a unified…
We define Convolutional Goppa Codes over algebraic curves and construct their corresponding dual codes. Examples over the projective line and over elliptic curves are described, obtaining in particular some Maximum-Distance Separable (MDS)…
In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…
In this note we draw a connection between noncommutative algebra and geometric group theory. Specifically, we ask whether it is possible to bound the sequence of codimensions for an associative PI-algebra using techniques from geometric…