Related papers: Multi-point Codes from the GGS Curves
Let $W/K$ be a nonempty scheme over the field of fractions of a Henselian local ring $R$. A result of Gabber, Liu and Lorenzini shows that the GCD of the set of degrees of closed points on $W$ (which is called the index of $W/K$) can be…
In this paper, we construct new families of convolutional codes. Such codes are obtained by means of algebraic geometry codes. Additionally, more families of convolutional codes are constructed by means of puncturing, extending, expanding…
Let $\mathcal{X}$ be a projective algebraic curve and denote by $\mathcal{X}^{'}$ its strict dual curve. The map $\gamma:\mathcal{X} \longrightarrow \mathcal{X}^{'}$ is called (strict) Gauss map of $\mathcal{X}$. In this manuscript, we…
In this paper, we demonstrate the construction of generalized Rough Polyhamronic Splines (GRPS) within the Bayesian framework, in particular, for multiscale PDEs with rough coefficients. The optimal coarse basis can be derived automatically…
In this work, we are concerned with the structure of sparse semigroups and some applications of them to Weierstrass points. We manage to describe, classify and find an upper bound for the genus of sparse semigroups. We also study the…
A $p$-adic version of Gromov-Witten invariants for counting plane curves of genus $g$ and degree $d$ through a given number of points is discussed. The multiloop version of $p$-adic string theory considered by Chekhov and others motivates…
We achieve new results on skew polynomial rings and their quotients, including the first explicit example of a skew polynomial ring where the ratio of the degree of a skew polynomial to the degree of its bound is not extremal. These methods…
Maximum distance separable (MDS) and almost maximum distance separable (AMDS) codes have been widely used in various fields such as communication systems, data storage, and quantum codes because of their algebraic properties and excellent…
In this manuscript, we introduce a new class of linear codes, called affine symplectic Grassmann codes, and determine their parameters, automorphism group, minimum distance codewords, dual code and other key features. These linear codes are…
Sarvepalli and Klappenecker showed how classical one-point codes on the Hermitian curve can be used to construct quantum codes. Homma and Kim determined the parameters of a larger family of codes, the two-point codes. In quantum…
An algorithm of Thomas Breuer produces complete lists of automorphism groups of curves for a fixed genus, and the code to execute this algorithm was written in the computer algebra package GAP and run by Breuer over a decade ago. For each…
Let K be a field of characteristic different from 2 and C an elliptic curve over K given by a Weierstrass equation. To divide an element of the group C by 2, one must solve a certain quartic equation. We characterise the quartics arising…
A multifold $1$-perfect code ($1$-perfect code for list decoding) in any graph is a set $C$ of vertices such that every vertex of the graph is at distance not more than $1$ from exactly $\mu$ elements of $C$. In $q$-ary Hamming graphs,…
We classify GL(2,R) invariant point markings over components of strata of Abelian differentials. Such point markings exist only when the component is hyperelliptic and arise from marking Weierstrass points or two points exchanged by the…
In this paper, we study the unit graph $ G(\mathbb{Z}_n) $, where $ n $ is of the form $n = p_1^{n_1} p_2^{n_2} \dots p_r^{n_r}$, with $ p_1, p_2, \dots, p_r $ being distinct prime numbers and $ n_1, n_2, \dots, n_r $ being positive…
Gray codes for vector spaces are considered in two graphs: the Grassmann graph, and the projective-space graph, both of which have recently found applications in network coding. For the Grassmann graph, constructions of cyclic optimal codes…
We present the program Boundary, whose source files are available at http://people.sissa.it/~maggiolo/boundary/. Given two natural numbers g and n satisfying 2g+n-2>0, the program generates all genus g stable graphs with n unordered marked…
We describe the arrangement of all Galois lines for the Giulietti--Korchm\'{a}ros curve in the projective $3$-space. As an application, we determine the set of all Galois points for a plane model of the GK curve. This curve possesses many…
Nested code pairs play a crucial role in the construction of ramp secret sharing schemes [Kurihara et al. 2012] and in the CSS construction of quantum codes [Ketkar et al. 2006]. The important parameters are (1) the codimension, (2) the…
A recent construction of linear complementary pairs (LCPs) of algebraic geometry codes is intimately linked to the identification of non-special divisors of small degree within a function field over a finite field. Let $\mathbb{F}_q$ be the…