Related papers: AG codes and AG quantum codes from the GGS curve
For each group $G$, $(|G| > 2)$ \, which acts as a full automorphism group on a genus 3 hyperelliptic curve, we determine the family of curves which have 2-Weierstrass points. Such families of curves are explicitly determined in terms of…
We study quantum communication in the presence of adversarial noise. In this setting, communicating with perfect fidelity requires using a quantum code of bounded minimum distance, for which the best known rates are given by the quantum…
In this paper, we construct several classes of maximum distance separable (MDS) codes via generalized Reed-Solomon (GRS) codes and extended GRS codes, where we can determine the dimensions of their Euclidean hulls or Hermitian hulls. It…
The present paper considers multipartite graphs from the perspective of design theory and coding theory. A one-factor $F$ of the complete multipartite graph $K_{n\times g}$ (with $n$ parts of size $g$) gives rise to a $(g+1)$-ary code…
We develop a comprehensive framework for constructing quantum error correcting codes (QECCs) from Abelian lattice gauge theories (LGTs) using quantum reference frames (QRFs) as a unifying formalism. We consider LGTs with arbitrary compact…
We give sufficient conditions for self-orthogonality with respect to symplectic, Euclidean and Hermitian inner products of a wide family of quasi-cyclic codes of index two. We provide lower bounds for the symplectic weight and the minimum…
In this article, we present a new construction of codes from algebraic curves. Given a curve over a non-prime finite field, the obtained codes are defined over a subfield. We call them Cartier Codes since their construction involves the…
Locally repairable codes are widely applicable in contemporary large-scale distributed cloud storage systems and various other areas. By making use of some algebraic structures of elliptic curves, Li et al. developed a series of $q$-ary…
Certain simplicial complexes are used to construct a subset $D$ of $\mathbb{F}_{2^n}^m$ and $D$, in turn, defines the linear code $C_{D}$ over $\mathbb{F}_{2^n}$ that consists of $(v\cdot d)_{d\in D}$ for $v\in \mathbb{F}_{2^n}^m$. Here we…
With a view to study problems of smoothability, we construct a minimal free resolution for the coordinate ring of an algebroid monomial curve associated to an $AS$ numerical semigroup (i.e. generated by an arithmetic sequence), obtained…
Let $\mathbb{K}$ be an algebraically closed field. In this paper, we consider the class of smooth plane curves of degree $n+1>3$ over $\mathbb{K}$, containing three points, $P_1,P_2,$ and $P_3$, such that $nP_1+P_2$, $nP_2+P_3$, and…
This paper introduces new constructions of sum-rank metric codes derived from algebraic function fields, as existing results on such codes remain limited. A major challenge lies in the determination of their parameters. We address this…
A unique decoding algorithm for general AG codes, namely multipoint evaluation codes on algebraic curves, is presented. It is a natural generalization of the previous decoding algorithm which was only for one-point AG codes. As such, it…
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…
The setting of projective systems can be used to study the parameters of a projective linear code $\mathcal{C}$. This can be done by considering the intersections of the point set $\Omega$ defined by the columns of a generating matrix for…
We construct asymptotically good nested Calderbank-Shor-Steane (CSS) code pairs from Hsu-Anastasopoulos codes and MacKay-Neal codes. In the fixed-degree regime, we prove that the coding rate stays bounded away from zero and that the…
For a given curve X and divisor class C, we give lower bounds on the degree of a divisor A such that A and A-C belong to specified semigroups of divisors. For suitable choices of the semigroups we obtain (1) lower bounds for the size of a…
A method of constructing algebraic-geometric codes with many automorphisms arising from Galois points for algebraic curves is presented.
Self-dual maximum distance separable (MDS) codes over finite fields are linear codes with significant combinatorial and cryptographic applications. Twisted generalized Reed-Solomon (TGRS) codes can be both MDS and self-dual. In this paper,…
In this paper we study the algebraic geometry of any two-point code on the Hermitian curve and reveal the purely geometric nature of their dual minimum distance. We describe the minimum-weight codewords of many of their dual codes through…