Related papers: Multi-point Codes over Kummer Extensions
We determine the Weierstrass semigroup $H(P_\infty,P_1,\ldots,P_m)$ at several rational points on the maximal curves which cannot be covered by the Hermitian curve introduced by Tafazolian, Teher\'an-Herrera, and Torres. Furthermore, we…
The projective space of order $n$ over a finite field $\F_q$ is a set of all subspaces of the vector space $\F_q^{n}$. In this work, we consider error-correcting codes in the projective space, focusing mainly on constant dimension codes. We…
We introduce and study a semigroup structure on the set of irreducible components of the Hurwitz space of marked coverings of a complex projective curve with given Galois group of the coverings and fixed ramification type. As application,…
One-weight codes, in which all nonzero codewords share the same weight, form a highly structured class of linear codes with deep connections to finite geometry. While their classification is well understood in the Hamming and rank metrics -…
In this paper we analyze the irreducibility of numerical semigroups with multiplicity up to four. Our approach uses the notion of Kunz-coordinates vector of a numerical semigroup recently introduced in (Blanco-Puerto, 2011). With this tool…
We provide a comprehensive overview of the fundamental structural properties of weighted projective Reed-Muller codes. We give a recursive construction for these codes, under some conditions for the weights, and we use it to derive bounds…
In the realm of algebraic geometric (AG) codes, characterizing dual codes has long been a challenging task. In this paper we introduces a generalized criterion to characterize self-orthogonality of AG codes based on residues, drawing upon…
We study perfect codes in the sum-rank metric, a generalization of both the Hamming and rank metrics relevant in multishot network coding and space-time coding. A perfect code attains equality in the sphere-packing bound, corresponding to a…
We study the classical expander codes, introduced by Sipser and Spielman \cite{SS96}. Given any constants $0< \alpha, \varepsilon < 1/2$, and an arbitrary bipartite graph with $N$ vertices on the left, $M < N$ vertices on the right, and…
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…
Error correcting codes are defined and important parameters for a code are explained. Parameters of new codes constructed on algebraic surfaces are studied. In particular, codes resulting from blowing up points in $\proj^2$ are briefly…
We develop a new approach to the study of the multipoint loci of holomorphic maps between complex manifolds. We relate the $k$-fold locus to the curvilinear component of the Hilbert scheme of $k$ points on the source space of the map, and…
In this paper, we use semidefinite programming and representation theory to compute new lower bounds on the crossing number of the complete bipartite graph $K_{m,n}$, extending a method from de Klerk et al. [SIAM J. Discrete Math. 20…
Let $k$ be a number field and $K$ a finite extension of $k$. We count points of bounded height in projective space over the field $K$ generating the extension $K/k$. As the height gets large we derive asymptotic estimates with a…
Constant-dimension codes with the maximum possible minimum distance have been studied under the name of partial spreads in Finite Geometry for several decades. Not surprisingly, for this subclass typically the sharpest bounds on the maximal…
In this work, subcovers $\mathcal{X}_{n,r}^s$ of the curve $\mathcal{X}_{n,r}$ are constructed, the Weierstrass semigroup $H(P_\infty)$ at the point $P_\infty \in \mathcal{X}_{n,r}^s$ is determined and the corresponding one-point AG codes…
Quasi-polycyclic (QP for short) codes over a finite chain ring $R$ are a generalization of quasi-cyclic codes, and these codes can be viewed as an $R[x]$-submodule of $\mathcal{R}_m^{\ell}$, where $\mathcal{R}_m:= R[x]/\langle f\rangle$,…
The real number system is geometrically extended to include three new anticommuting square roots of plus one, each such root representing the direction of a unit vector along the orthonormal coordinate axes of Euclidean 3-space. The…
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…
Codes in the sum-rank metric have received many attentions in recent years, since they have wide applications in the multishot network coding, the space-time coding and the distributed storage. In this paper, by constructing covering codes…