Decoding algebraic-geometric codes up to the designed minimum distance
From MaRDI portal
Publication:4034429
DOI10.1109/18.179340zbMATH Open0765.94021OpenAlexW2097083932MaRDI QIDQ4034429FDOQ4034429
Authors:
Publication date: 16 May 1993
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.179340
Recommendations
- Fast decoding of algebraic-geometric codes up to the designed minimum distance
- Simplified understanding and efficient decoding of a class of algebraic-geometric codes
- scientific article
- On the decoding of algebraic-geometric codes
- Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases
Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)
Cited In (52)
- Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes
- A generalized floor bound for the minimum distance of geometric Goppa codes
- Minimum distance of Hermitian two-point codes
- Coset bounds for algebraic geometric codes
- Minimum Distance Decoding of General Algebraic Geometry Codes via Lists
- The key equation for one-point codes and efficient error evaluation
- On affine variety codes from the Klein quartic
- Sparse FGLM algorithms
- Further improvements on the designed minimum distance of algebraic geometry codes
- Cryptanalysis of Public-Key Cryptosystems That Use Subcodes of Algebraic Geometry Codes
- 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
- Improved evaluation codes defined by plane valuations
- Aggregate error locator and error value computation in AG codes
- Finding a basis of a linear system with pairwise distinct discrete valuations on an algebraic curve
- Deformations and smoothability of certain AS monomial curves
- Majority coset decoding
- A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. II
- Construction and decoding of a class of algebraic geometry codes
- Simplified understanding and efficient decoding of a class of algebraic-geometric codes
- The second Feng-Rao number for codes coming from telescopic semigroups
- Title not available (Why is that?)
- Goppa codes with Weierstrass pairs
- Decoding of differential AG codes
- Suzuki-invariant codes from the Suzuki curve
- Hermitian-invariant codes from the Hermitian curve
- The theta divisor of a Jacobian variety and the decoding of geometric Goppa codes
- Smoothability and order bound for AS semigroups.
- Relative generalized Hamming weights of cyclic codes
- Distance bounds for algebraic geometric codes
- Decoding beyond the designed distance for certain algebraic codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asymmetric code-theoretical schemes constructed with the use of algebraic geometric codes
- A displacement approach to efficient decoding of algebraic-geometric codes
- Achieving the designed error capacity in decoding algebraic-geometric codes
- On the second Feng-Rao distance of algebraic geometry codes related to Arf semigroups
- Symbolic Hamburger-Noether expressions of plane curves and applications to AG codes
- On the generalized Feng-Rao numbers of numerical semigroups generated by intervals
- Syndrome series of one point algebraic-geometric codes and majority voting scheme
- New lower bounds for the minimum distance of generalized algebraic geometry codes
- Algebraic geometric codes with applications
- Computing Weierstrass semigroups and the Feng-Rao distance from singular plane models
- Evaluation codes defined by finite families of plane valuations at infinity
- A simple approach for construction of algebraic-geometric codes from affine plane curves
- On the evaluation codes given by simple \(\delta \)-sequences
- The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting
- Some decoding applications of minimal realization
- Goppa-like bounds for the generalized Feng-Rao distances.
- Bounds for generalized Hamming weights of general AG codes
- Decoding algebraic geometry codes by a key equation
- Feng-Rao decoding of primary codes
This page was built for publication: Decoding algebraic-geometric codes up to the designed minimum distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4034429)
