Decoding algebraic-geometric codes up to the designed minimum distance
From MaRDI portal
Publication:4034429
DOI10.1109/18.179340zbMath0765.94021OpenAlexW2097083932MaRDI QIDQ4034429
No author found.
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
Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)
Related Items (39)
On the evaluation codes given by simple \(\delta \)-sequences ⋮ Minimum distance of Hermitian two-point codes ⋮ Cryptanalysis of Public-Key Cryptosystems That Use Subcodes of Algebraic Geometry Codes ⋮ Decoding of differential AG codes ⋮ Suzuki-invariant codes from the Suzuki curve ⋮ Aggregate error locator and error value computation in AG codes ⋮ The second Feng-Rao number for codes coming from telescopic semigroups ⋮ The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting ⋮ The theta divisor of a Jacobian variety and the decoding of geometric Goppa codes ⋮ Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes ⋮ Smoothability and order bound for AS semigroups. ⋮ Coset bounds for algebraic geometric codes ⋮ Relative generalized Hamming weights of cyclic codes ⋮ Hermitian-invariant codes from the Hermitian curve ⋮ Some decoding applications of minimal realization ⋮ Evaluation codes defined by finite families of plane valuations at infinity ⋮ Algebraic geometric codes with applications ⋮ Sparse FGLM algorithms ⋮ Feng-Rao decoding of primary codes ⋮ Deformations and smoothability of certain AS monomial curves ⋮ Computing Weierstrass semigroups and the Feng-Rao distance from singular plane models ⋮ On affine variety codes from the Klein quartic ⋮ List decoding algorithm based on voting in Gröbner bases for general one-point AG codes ⋮ Distance bounds for algebraic geometric codes ⋮ Goppa codes with Weierstrass pairs ⋮ Improved evaluation codes defined by plane valuations ⋮ A generalized floor bound for the minimum distance of geometric Goppa codes ⋮ Syndrome series of one point algebraic-geometric codes and majority voting scheme ⋮ Asymmetric code-theoretical schemes constructed with the use of algebraic geometric codes ⋮ On the second Feng-Rao distance of algebraic geometry codes related to Arf semigroups ⋮ Goppa-like bounds for the generalized Feng-Rao distances. ⋮ A type of recurring relation on sequences and efficient decoding of a class of algebraic-geometric codes. II ⋮ On the generalized Feng-Rao numbers of numerical semigroups generated by intervals ⋮ Finding a basis of a linear system with pairwise distinct discrete valuations on an algebraic curve ⋮ Decoding algebraic geometry codes by a key equation ⋮ Bounds for generalized Hamming weights of general AG codes ⋮ The key equation for one-point codes and efficient error evaluation ⋮ Symbolic Hamburger-Noether expressions of plane curves and applications to AG codes ⋮ From primary to dual affine variety codes over the Klein quartic
This page was built for publication: Decoding algebraic-geometric codes up to the designed minimum distance
