A simple approach for construction of algebraic-geometric codes from affine plane curves

DOI10.1109/18.335972zbMath0814.94027OpenAlexW2111368253MaRDI QIDQ4324163

No author found.

Publication date: 1 March 1995

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.335972

zbMATH Keywords

complexity algebraic-geometric codes linear code error-correcting codes designed minimum distance fast decoding affine plane curves

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Parallel algorithms in computer science (68W10) Decoding (94B35)

Related Items (26)

Characterization of graphs associated with the ideal of numerical semigroups ⋮ Patterns on numerical semigroups. ⋮ On the evaluation codes given by simple \(\delta \)-sequences ⋮ On puncturing of codes from norm-trace curves ⋮ Further examples of maximal curves which cannot be covered by the Hermitian curve ⋮ On some invariants in numerical semigroups and estimations of the order bound. ⋮ Weighted Reed-Muller codes revisited ⋮ Further improvements on the Feng-Rao bound for dual codes ⋮ Integral closures and weight functions over finite fields. ⋮ Evaluation codes defined by finite families of plane valuations at infinity ⋮ Feng-Rao decoding of primary codes ⋮ Deformations and smoothability of certain AS monomial curves ⋮ On numerical semigroups and the order bound. ⋮ On affine variety codes from the Klein quartic ⋮ Computation of numerical semigroups by means of seeds ⋮ Evaluation codes from order domain theory ⋮ On the existence of order functions ⋮ On the structure of order domains ⋮ On numerical semigroups with embedding dimension three ⋮ Redundancies of correction capability optimized Reed-Muller codes ⋮ On the order bound of one-point algebraic geometry codes. ⋮ On numerical semigroups and the redundancy of improved codes correcting generic errors ⋮ Theory of supports for linear codes endowed with the sum-rank metric ⋮ Weierstrass semigroup at \(m+1\) rational points in maximal curves which cannot be covered by the Hermitian curve ⋮ An improvement of the Feng-Rao bound for primary codes ⋮ From primary to dual affine variety codes over the Klein quartic

This page was built for publication: A simple approach for construction of algebraic-geometric codes from affine plane curves