Improved geometric Goppa codes. I. Basic theory

DOI10.1109/18.476241MaRDI QIDQ4880293zbMATH OpenOpenAlexFDO

Authors

Publication date 4 June 1996

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

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

zbMATH Keywords

algebraic-geometric codesgeometric Goppa codesmultilevel codesalgebraic-geometric surfacesfast decoding up to designed minimum distance

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Recommendations

• scientific article; zbMATH DE number 3974889
• On Weierstrass semigroups and the redundancy of improved geometric Goppa codes
• GENERALIZED GEOMETRIC GOPPA CODES
• Construction of improved geometric Goppa codes from Klein curves and Klein-like curves

Cited in

(31)

• Twisting geometric codes
• Feng-Rao decoding of primary codes
• Evaluation codes from order domain theory
• Further improvements on the Feng-Rao bound for dual codes
• On affine variety codes from the Klein quartic
• From primary to dual affine variety codes over the Klein quartic
• List decoding algorithm based on voting in Gröbner bases for general one-point AG codes
• On the generalized Hamming weights of hyperbolic codes
• On puncturing of codes from norm-trace curves
• Geometric spaces and efficient codes
• Redundancies of correction capability optimized Reed-Muller codes
• On codes from norm-trace curves
• The minimum weights of two-point AG codes on norm-trace curves
• Weighted Reed-Muller codes revisited
• New quantum codes from evaluation and matrix-product codes
• On Weierstrass semigroups and the redundancy of improved geometric Goppa codes
• On the existence of order functions
• Parameters of the codes over affine varieties
• Goppa geometric codes achieving the Gilbert-Varshamov bound
• The structure of algebras admitting well-agreeing near weights
• On the geometry of Hermitian one-point codes
• An improvement of the Feng-Rao bound on minimum distance
• When are two geometric Goppa codes equal?
• Improvement on Parameters of Goppa Geometry Codes From Maximal Curves Using the VlĂduŢ–Xing Method
• High dimensional affine codes whose square has a designed minimum distance
• On numerical semigroups and the redundancy of improved codes correcting generic errors
• Evaluation codes defined by finite families of plane valuations at infinity
• Construction of improved geometric Goppa codes from Klein curves and Klein-like curves
• On the evaluation codes given by simple \(\delta \)-sequences
• The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting
• Sudan-decoding generalized geometric Goppa codes.

This page was built for publication: Improved geometric Goppa codes. I. Basic theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4880293)