Improved geometric Goppa codes. I. Basic theory
DOI10.1109/18.476241zbMATH Open0866.94025OpenAlexW1980801869MaRDI QIDQ4880293FDOQ4880293
Author name not available (Why is that?)
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
Recommendations
algebraic-geometric codesgeometric Goppa codesmultilevel codesalgebraic-geometric surfacesfast decoding up to designed minimum distance
Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)
Cited In (29)
- Evaluation codes from order domain theory
- On affine variety codes from the Klein quartic
- Further improvements on the Feng-Rao bound for dual codes
- From primary to dual affine variety codes over the Klein quartic
- On the generalized Hamming weights of hyperbolic codes
- List decoding algorithm based on voting in Gröbner bases for general one-point AG 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
- On the existence of order functions
- Weighted Reed-Muller codes revisited
- On Weierstrass semigroups and the redundancy of improved geometric Goppa codes
- New quantum codes from evaluation and matrix-product codes
- Parameters of the codes over affine varieties
- Goppa geometric codes achieving the Gilbert-Varshamov bound
- The structure of algebras admitting well-agreeing near weights
- An improvement of the Feng-Rao bound on minimum distance
- On the geometry of Hermitian one-point codes
- When are two geometric Goppa codes equal?
- 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
- On the evaluation codes given by simple \(\delta \)-sequences
- Construction of improved geometric Goppa codes from Klein curves and Klein-like curves
- The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting
- Sudan-decoding generalized geometric Goppa codes.
- Feng-Rao decoding of primary 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)
