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