English
Related papers

Related papers: Goppa codes over Edwards curves

200 papers

We generalize Sepasdar's method for finding a generator matrix of two-dimensional cyclic codes to find an independent subset of a general multicyclic code, which may form a basis of the code as a vector subspace. A generator matrix can be…

Information Theory · Computer Science 2019-06-11 R. Andriamifidisoa , R. M. Lalasoa , T. J. Rabeherimanana

In this paper, we introduce multivariate Goppa codes, which contain as a special case the well-known, classical Goppa codes. We provide a parity check matrix for a multivariate Goppa code in terms of a tensor product of generalized…

Information Theory · Computer Science 2024-02-07 Hiram H. López , Gretchen L. Matthews

An efficient algorithm for computing the branching structure of a compact Riemann surface defined via an algebraic curve is presented. Generators of the fundamental group of the base of the ramified covering punctured at the discriminant…

Computational Geometry · Computer Science 2011-08-11 J. Frauendiener , C. Klein , V. Shramchenko

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…

Information Theory · Computer Science 2008-02-19 John B. Little

Let C be a projective curve defined over a field k and let D be a divisor of C. The Riemann-Roch space L(D) is the set of rational functions on C for which certain zeros are imposed and certain poles are allowed, with some multiplicities…

Algebraic Geometry · Mathematics 2026-03-03 Dounia Darkaoui , Martin Weimann

Let X be an Abelian surface and C a holomorphic curve in X representing a primitive homology class. The space of genus g curves in the class of C is g dimensional. We count the number of such curves that pass through g generic points and we…

Algebraic Geometry · Mathematics 2007-05-23 Jim Bryan , Naichung Conan Leung

The theory of algebraic-geometric codes has been developed in the beginning of the 80's after a paper of V.D. Goppa. Given a smooth projective algebraic curve X over a finite field, there are two different constructions of error-correcting…

Algebraic Geometry · Mathematics 2010-08-24 A. Couvreur

In this paper, we provide conditions that hulls of generalized Reed-Solomon (GRS) codes are also GRS codes from algebraic geometry codes. If the conditions are not satisfied, we provide a method of linear algebra to find the bases of hulls…

Information Theory · Computer Science 2024-01-25 Xue Jia , Qin Yue , Huan Sun , Junzhen Sui

For the integer $ D=pq$ of the product of two distinct odd primes, we construct an elliptic curve $E_{2rD}:y^2=x^3-2rDx$ over $\mathbb Q$, where $r$ is a parameter dependent on the classes of $p$ and $q$ modulo 8, and show, under the parity…

Number Theory · Mathematics 2015-03-13 Xiumei Li , Jinxiang Zeng

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…

Number Theory · Mathematics 2007-07-16 Chris Lomont

We compute the class of arithmetic genus two Teichmueller curves in the Picard group of pseudo-Hilbert modular surfaces, distinguished according to their torsion order and spin invariant. As an application, we compute the number of genus…

Algebraic Geometry · Mathematics 2015-04-03 André Kappes , Martin Moeller

To count bundles on curves, we study zetas of elliptic curves and their zeros. There are two types, i.e., the pure non-abelian zetas defined using moduli spaces of semi-stable bundles, and the group zetas defined for special linear groups.…

Algebraic Geometry · Mathematics 2012-02-07 Lin Weng

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…

Information Theory · Computer Science 2016-11-15 Mubarak Jibril , Martin tomlinson , Mohammed Zaki Ahmed , Cen Tjhai

This article gives an elementary computational proof of the group law for Edwards elliptic curves following Bernstein, Lange, et al., Edwards, and Friedl. The associative law is expressed as a polynomial identity over the integers that is…

Algebraic Geometry · Mathematics 2016-10-18 Thomas Hales

For applications in algebraic geometric codes, an explicit description of bases of Riemann-Roch spaces of divisors on function fields over finite fields is needed. We give an algorithm to compute such bases for one point divisors, and…

Number Theory · Mathematics 2011-07-01 Francesco Noseda , Gilvan Oliveira , Luciane Quoos

We give practical algorithms for computing the divisor class group and the gonality of a curve over a finite field, achieving several orders of magnitude speedup over existing methods for sufficiently large genus or residue field. The…

Number Theory · Mathematics 2026-02-20 Maarten Derickx , Kenji Terao

We study the homogeneous coordinate rings of real multiplication noncommutative tori as defined by A. Polishchuk. Our aim is to understand how these rings give rise to an arithmetic structure on the noncommutative torus. We start by giving…

Quantum Algebra · Mathematics 2007-05-23 Jorge Plazas

For Kummer extensions defined by $y^m = f (x)$, where $f (x)$ is a separable polynomial over the finite field $\mathbb{F}_q$, we compute the number of Weierstrass gaps at two totally ramified places. For many totally ramified places we give…

Algebraic Geometry · Mathematics 2016-11-11 Daniele Bartoli , Luciane Quoos , Giovanni Zini

We give a complete answer to the question of when two curves in two different Riemannian manifolds can be seen as trajectories of rolling one manifold on the other without twisting or slipping. We show that up to technical hypotheses, a…

Differential Geometry · Mathematics 2015-08-13 Mauricio Godoy Molina , Erlend Grong

We define and study a class of codes obtained from scrolls over curves of any genus over finite fields. These codes generalize Goppa codes in a natural way, and the orthogonal complements of these codes belong to the same class. We show how…

Algebraic Geometry · Mathematics 2007-05-23 George H. Hitching , Trygve Johnsen