Decoding algebraic-geometric codes up to the designed minimum distance
From MaRDI portal
(Redirected from Publication:4034429)
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; zbMATH DE number 52992
- On the decoding of algebraic-geometric codes
- Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases
Cited in
(54)- A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. II
- Finding a basis of a linear system with pairwise distinct discrete valuations on an algebraic curve
- Decoding algebraic geometry codes by a key equation
- The key equation for one-point codes and efficient error evaluation
- The second Feng-Rao number for codes coming from telescopic semigroups
- Relative generalized Hamming weights of cyclic codes
- Sparse FGLM algorithms
- On affine variety codes from the Klein quartic
- On the second Feng-Rao distance of algebraic geometry codes related to Arf semigroups
- Goppa-like bounds for the generalized Feng-Rao distances.
- The theta divisor of a Jacobian variety and the decoding of geometric Goppa codes
- Smoothability and order bound for AS semigroups.
- Algebraic geometric codes with applications
- Computing Weierstrass semigroups and the Feng-Rao distance from singular plane models
- From primary to dual affine variety codes over the Klein quartic
- Bounds for generalized Hamming weights of general AG codes
- New lower bounds for the minimum distance of generalized algebraic geometry codes
- Evaluation codes defined by finite families of plane valuations at infinity
- Feng-Rao decoding of primary codes
- A generalized floor bound for the minimum distance of geometric Goppa codes
- Asymmetric code-theoretical schemes constructed with the use of algebraic geometric codes
- On the evaluation codes given by simple \(\delta \)-sequences
- Minimum distance of Hermitian two-point codes
- A displacement approach to efficient decoding of algebraic-geometric codes
- On the generalized Feng-Rao numbers of numerical semigroups generated by intervals
- Symbolic Hamburger-Noether expressions of plane curves and applications to AG codes
- Decoding of differential AG codes
- Suzuki-invariant codes from the Suzuki curve
- Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes
- Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes
- scientific article; zbMATH DE number 125897 (Why is no real title available?)
- Decoding beyond the designed distance for certain algebraic codes
- Achieving the designed error capacity in decoding algebraic-geometric codes
- Majority coset decoding
- Simplified understanding and efficient decoding of a class of algebraic-geometric codes
- A simple approach for construction of algebraic-geometric codes from affine plane curves
- scientific article; zbMATH DE number 1775409 (Why is no real title available?)
- Some decoding applications of minimal realization
- Deformations and smoothability of certain AS monomial curves
- scientific article; zbMATH DE number 2154145 (Why is no real title available?)
- Construction and decoding of a class of algebraic geometry codes
- List decoding algorithm based on voting in Gröbner bases for general one-point AG codes
- Minimum Distance Decoding of General Algebraic Geometry Codes via Lists
- Distance bounds for algebraic geometric codes
- Goppa codes with Weierstrass pairs
- Syndrome series of one point algebraic-geometric codes and majority voting scheme
- Hermitian-invariant codes from the Hermitian curve
- Coset bounds for algebraic geometric codes
- Duals of multiplicity codes
- Counterexamples to the low-degree conjecture
- Aggregate error locator and error value computation in AG codes
- The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting
- Further improvements on the designed minimum distance of algebraic geometry codes
- Improved evaluation codes defined by plane valuations
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)
