Evaluation codes defined by finite families of plane valuations at infinity
DOI10.1007/s10623-012-9738-7zbMath1314.94111OpenAlexW2158335271MaRDI QIDQ2436567
Francisco Monserrat, Carlos Galindo Pastor
Publication date: 25 February 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10234/65178
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Valuations and their generalizations for commutative rings (13A18) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- The Abhyankar-Moh theorem for plane valuations at infinity
- Extension of the Berlekamp-Massey algorithm to N dimensions
- On the structure of order domains
- Realization of a certain class of semi-groups as value semi-groups of valuations
- Evaluation codes and plane valuations
- Local uniformization on algebraic surfaces over ground fields of characteristic \(p\neq 0\)
- Affine plane curves with one place at infinity
- Construction of affine plane curves with one place at infinity.
- Lectures on expansion techniques in algebraic geometry. With notes by Balwant Singh
- Computing Weierstrass semigroups and the Feng-Rao distance from singular plane models
- The reduction of the singularities of an algebraic surface
- Local uniformization on algebraic varieties
- Valuations in Function Fields of Surfaces
- On the Valuations Centered in a Local Domain
- Near Orders and Codes
- δ-sequences and evaluation codes defined by plane valuations at infinity
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- Codes and information
- Fast decoding of codes from algebraic plane curves
- Decoding algebraic-geometric codes up to the designed minimum distance
- On Planar Curves
- A simple approach for construction of algebraic-geometric codes from affine plane curves
- Construction and decoding of a class of algebraic geometry codes
- Plane valuations and their completions
- A class of constacyclic codes
- Fast decoding of algebraic-geometric codes up to the designed minimum distance
- Improved geometric Goppa codes. I. Basic theory
- Decoding of codes defined by a single point on a curve
- Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
- Generalized Sudan’s List Decoding for Order Domain Codes
- Shift-register synthesis and BCH decoding
- New codes for the Berlekamp-Massey-Sakata algorithm
- On the decoding of algebraic-geometric codes
This page was built for publication: Evaluation codes defined by finite families of plane valuations at infinity