Algebraic geometry constructions of convolutional codes

Las técnicas de geometría algebraica para construir códigos lineales pueden ser aplicados a la construcción de códigos convolucionales, usando curvas algebraicas sobre los campos de función. En este sentido se construyen códigos Goppa convolucionales y se provee un sistema para construir códigos convolucionales con propiedades prescritas.Algebraic-geometric techniques to construct linear codes can be appliedto construct convolutional codes, using algebraic curves over functionfields. In this way we construct convolutional Goppa codes and providea systematic way for constructing convolutional codes with prescribedproperties. We study convolutional Goppa codes defined by the projec-tive line and elliptic curves in detail

Codes and the Cartier Operator

A part of this work has been done when the author was a Post Doc researcher supported by the French ANR Defis program under contract ANR-08-EMER-003 (COCQ project)International audienceIn 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 Cartier operator. This new class of codes can be regarded as a natural geometric generalisation of classical Goppa codes. In particular, we prove that a well-known property satisfied by classical Goppa codes extends naturally to Cartier codes. We prove general lower bounds for the dimension and the minimum distance of these codes and compare our construction with a classical one: the subfield subcodes of Algebraic Geometry codes. We prove that every Cartier code is contained in a subfield subcode of an Algebraic Geometry code and that the two constructions have similar asymptotic performances. We also show that some known results on subfield subcodes of Algebraic Geometry codes can be proved nicely by using properties of the Cartier operator and that some known bounds on the dimension of subfield subcodes of Algebraic Geometry codes can be improved thanks to Cartier codes and the Cartier operator

ON THE ORDER BOUNDS FOR ONE-POINT AG CODES

The order bound for the minimum distance of algebraic geometry codes was originally defined for the duals of one-point codes and later generalized for arbitrary algebraic geometry codes. Another bound of order type for the minimum distance of general linear codes, and for codes from order domains in particular, was given in [1]. Here we investigate in detail the application of that bound to one-point algebraic geometry codes, obtaining a bound d* for the minimum distance of these codes. We establish a connection between d* and the order bound and its generalizations. We also study the improved code constructions based on d*. Finally we extend d* to all generalized Hamming weights.53489504Danish National Science Research Council [FNV-21040368]Danish FNU [272-07-0266]Junta de CyL [VA065A07]Spanish Ministry for Science and Technology [MTM-2007-66842-C02-01, MTM 2007-64704]Aalborg UniversityThe Technical University of DenmarkDanish National Science Research Council [FNV-21040368]Danish FNU [272-07-0266]Junta de CyL [VA065A07]Spanish Ministry for Science and Technology [MTM-2007-66842-C02-01, MTM 2007-64704

Locally recoverable codes on surfaces

A linear error correcting code is a subspace of a finite-dimensional space over a finite field with a fixed coordinate system. Such a code is said to be locally recoverable with locality $r$ if, for every coordinate, its value at a codeword can be deduced from the value of (certain) $r$ other coordinates of the codeword. These codes have found many recent applications, e.g., to distributed cloud storage. We will discuss the problem of constructing good locally recoverable codes and present some constructions using algebraic surfaces that improve previous constructions and sometimes provide codes that are optimal in a precise sense. The main conceptual contribution of this paper is to consider surfaces fibered over a curve in such a way that each recovery set is constructed from points in a single fiber. This allows us to use the geometry of the fiber to guarantee the local recoverability and use the global geometry of the surface to get a hold on the standard parameters of our codes. We look in detail at situations where the fibers are rational or elliptic curves and provide many examples applying our methods.Comment: Revised version; incorporates suggestions by referee

Asymptotic Bound on Binary Self-Orthogonal Codes

We present two constructions for binary self-orthogonal codes. It turns out that our constructions yield a constructive bound on binary self-orthogonal codes. In particular, when the information rate R=1/2, by our constructive lower bound, the relative minimum distance \delta\approx 0.0595 (for GV bound, \delta\approx 0.110). Moreover, we have proved that the binary self-orthogonal codes asymptotically achieve the Gilbert-Varshamov bound.Comment: 4 pages 1 figur