Feng-Rao decoding of primary codes
From MaRDI portal
Publication:2447745
Abstract: We show that the Feng-Rao bound for dual codes and a similar bound by Andersen and Geil [H.E. Andersen and O. Geil, Evaluation codes from order domain theory, Finite Fields Appl., 14 (2008), pp. 92-123] for primary codes are consequences of each other. This implies that the Feng-Rao decoding algorithm can be applied to decode primary codes up to half their designed minimum distance. The technique applies to any linear code for which information on well-behaving pairs is available. Consequently we are able to decode efficiently a large class of codes for which no non-trivial decoding algorithm was previously known. Among those are important families of multivariate polynomial codes. Matsumoto and Miura in [R. Matsumoto and S. Miura, On the Feng-Rao bound for the L-construction of algebraic geometry codes, IEICE Trans. Fundamentals, E83-A (2000), pp. 926-930] (See also [P. Beelen and T. H{o}holdt, The decoding of algebraic geometry codes, in Advances in algebraic geometry codes, pp. 49-98]) derived from the Feng-Rao bound a bound for primary one-point algebraic geometric codes and showed how to decode up to what is guaranteed by their bound. The exposition by Matsumoto and Miura requires the use of differentials which was not needed in [Andersen and Geil 2008]. Nevertheless we demonstrate a very strong connection between Matsumoto and Miura's bound and Andersen and Geil's bound when applied to primary one-point algebraic geometric codes.
Recommendations
- An improvement of the Feng-Rao bound for primary codes
- A fast decoding method of AG codes from Miura-Kamiya curves \(C_{ab}\) up to half the Feng-Rao bound
- Fast erasure-and-error decoding of algebraic geometry codes up to the Feng-Rao bound
- Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
- Fast decoding of algebraic-geometric codes up to the designed minimum distance
Cites work
- scientific article; zbMATH DE number 417878 (Why is no real title available?)
- scientific article; zbMATH DE number 5529001 (Why is no real title available?)
- scientific article; zbMATH DE number 1284423 (Why is no real title available?)
- scientific article; zbMATH DE number 493096 (Why is no real title available?)
- scientific article; zbMATH DE number 2081133 (Why is no real title available?)
- A simple approach for construction of algebraic-geometric codes from affine plane curves
- An Extension of the Order Bound for AG Codes
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
- Decoding affine variety codes using Gröbner bases
- Decoding algebraic-geometric codes up to the designed minimum distance
- Distance bounds for algebraic geometric codes
- Evaluation codes and plane valuations
- Evaluation codes from an affine variety code perspective
- Evaluation codes from order domain theory
- Generalized Hamming weights of q-ary Reed-Muller codes
- Improved geometric Goppa codes. I. Basic theory
- Majority coset decoding
- New codes for the Berlekamp-Massey-Sakata algorithm
- On codes from norm-trace curves
- On the order bounds for one-point AG codes
- On the structure of order domains
- The order bound for general algebraic geometric codes
- The ubiquity of order domains for the construction of error control codes
- Unique Decoding of Plane AG Codes via Interpolation
- δ-sequences and evaluation codes defined by plane valuations at infinity
Cited in
(11)- FGLM-Like Decoding: from Fitzpatrick’s Approach to Recent Developments
- scientific article; zbMATH DE number 1839528 (Why is no real title available?)
- On the distance of stabilizer quantum codes from \(J\)-affine variety 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
- Decoding of differential AG codes
- An improvement of the Feng-Rao bound for primary codes
- Stabilizer quantum codes from \(J\)-affine variety codes and a new Steane-like enlargement
- Relative generalized Hamming weights of \(q\)-ary Reed-Muller codes
- On the evaluation codes given by simple \(\delta \)-sequences
- Bounds for generalized Hamming weights of general AG codes
This page was built for publication: Feng-Rao decoding of primary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2447745)
