Improved geometric Goppa codes. I. Basic theory
From MaRDI portal
Publication:4880293
DOI10.1109/18.476241zbMath0866.94025OpenAlexW1980801869MaRDI QIDQ4880293
No author found.
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
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)
Related Items (22)
On the evaluation codes given by simple \(\delta \)-sequences ⋮ The minimum weights of two-point AG codes on norm-trace curves ⋮ The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting ⋮ On puncturing of codes from norm-trace curves ⋮ Weighted Reed-Muller codes revisited ⋮ On the geometry of Hermitian one-point codes ⋮ Further improvements on the Feng-Rao bound for dual codes ⋮ On codes from norm-trace curves ⋮ Evaluation codes defined by finite families of plane valuations at infinity ⋮ Parameters of the codes over affine varieties ⋮ Feng-Rao decoding of primary codes ⋮ On affine variety codes from the Klein quartic ⋮ The structure of algebras admitting well-agreeing near weights ⋮ List decoding algorithm based on voting in Gröbner bases for general one-point AG codes ⋮ Evaluation codes from order domain theory ⋮ On the existence of order functions ⋮ An improvement of the Feng-Rao bound on minimum distance ⋮ Redundancies of correction capability optimized Reed-Muller codes ⋮ New quantum codes from evaluation and matrix-product codes ⋮ On numerical semigroups and the redundancy of improved codes correcting generic errors ⋮ High dimensional affine codes whose square has a designed minimum distance ⋮ From primary to dual affine variety codes over the Klein quartic
This page was built for publication: Improved geometric Goppa codes. I. Basic theory
