相关论文: Still better nonlinear codes from modular curves

We introduce a new construction of error-correcting codes from algebraic curves over finite fields. Modular curves of genus g -> infty over a field of size q0^2 yield nonlinear codes more efficient than the linear Goppa codes obtained from…

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…

This paper concerns towers of curves over a finite field with many rational points, following Garcia--Stichtenoth and Elkies. We present a new method to produce such towers. A key ingredient is the study of algebraic solutions to Fuchsian…

Expository paper discussing AG or Goppa codes arising from curves, first from an abstract general perspective then turning to concrete examples associated to modular curves. We will try to explain these extremely technical ideas using a…

We present new constructions of quasi-cyclic (QC) and generalized quasi-cyclic (GQC) codes from algebraic curves. Unlike previous approaches based on elliptic curves, our method applies to curves that are Kummer extensions of the rational…

This Diplom thesis provides an explicit construction of a quantum Goppa code for any hyperelliptic curve over a non-binary field. Hyperelliptic curves have conjugate pairs of rational places. We use these pairs to construct self-orthogonal…

Motivated by Xing's method [7], we show that there exist [n,k,d] linear Hermitian codes over F_{q^2} with k+d>=n-3 for all sufficiently large q. This improves the asymptotic bound of Algebraic-Geometry codes from Hermitian curves given in…

We suggest a new approach to obtain bounds on locally correctable and some locally testable binary linear codes, by arguing that these codes (or their subcodes) have coset leader graphs with high discrete Ricci curvature. The bounds we…

In coding theory, constructing codes with good parameters is one of the most important and fundamental problems. Though a great many of good codes have been produced, most of them are defined over alphabets of sizes equal to prime powers.…

In this paper we extend the work of Lisonek and Singh on construction X for quantum error-correcting codes to finite fields of order $p^2^ where p is prime. The results obtained are applied to the dual of Hermitian repeated root cyclic…

In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction…

Algebraic geometry codes or Goppa codes are defined with places of degree one. In constructing generalised algebraic geometry codes places of higher degree are used. In this paper we present 41 new codes over GF(16) which improve on the…

We prove the existence of topological quantum error correcting codes with encoding rates $k/n$ asymptotically approaching the maximum possible value. Explicit constructions of these topological codes are presented using surfaces of…

In this note, a class of error-correcting codes is associated to a toric variety associated to a fan defined over a finite field $\fff_q$, analogous to the class of Goppa codes associated to a curve. For such a ``toric code'' satisfying…

We consider locally repairable codes over small fields and propose constructions of optimal cyclic and linear codes in terms of the dimension for a given distance and length. Four new constructions of optimal linear codes over small fields…

Algebraic-geometric codes on Garcia-Stichtenoth family of curves are used to construct the asymptotically good quantum codes.

Locally repairable codes which are optimal with respect to the bound presented by Prakash et al. are considered. New upper bounds on the length of such optimal codes are derived. The new bounds both improve and generalize previously known…

We prove that all elliptic curves defined over totally real cubic fields are modular. This builds on previous work of Freitas, Le Hung and Siksek, who proved modularity of elliptic curves over real quadratic fields, as well as recent…

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…

Algebraic Geometric codes associated to a recently discovered class of maximal curves are investigated. As a result, some linear codes with better parameters with respect to the previously known ones are discovered, and 70 improvements on…