On the evaluation codes given by simple \(\delta \)-sequences
From MaRDI portal
Publication:2634585
DOI10.1007/s00200-015-0271-6zbMath1342.94127OpenAlexW2462425398MaRDI QIDQ2634585
R. Pérez-Casales, Carlos Galindo Pastor
Publication date: 16 February 2016
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-015-0271-6
Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Abhyankar-Moh theorem for plane valuations at infinity
- List decoding algorithm based on voting in Gröbner bases for general one-point AG codes
- Extension of the Berlekamp-Massey algorithm to N dimensions
- Coset bounds for algebraic geometric codes
- On the structure of order domains
- Improved decoding of affine-variety codes
- Stabilizer quantum codes from \(J\)-affine variety codes and a new Steane-like enlargement
- New quantum codes from evaluation and matrix-product codes
- Evaluation codes and plane valuations
- Duality for some families of correction capability optimized evaluation codes
- Algebroid curves in positive characteristic
- Decoding affine variety codes using Gröbner bases
- Lectures on expansion techniques in algebraic geometry. With notes by Balwant Singh
- Computing Weierstrass semigroups and the Feng-Rao distance from singular plane models
- Quantum codes from affine variety codes and their subfield-subcodes
- Evaluation codes defined by finite families of plane valuations at infinity
- Feng-Rao decoding of primary codes
- Evaluation codes from order domain theory
- Unique Decoding of General AG Codes
- How to share a secret
- Valuations in Function Fields of Surfaces
- δ-sequences and evaluation codes defined by plane valuations at infinity
- The BMS Algorithm
- The BMS Algorithm and Decoding of AG Codes
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- Codes and information
- Fast decoding of codes from algebraic plane curves
- Decoding algebraic-geometric codes up to the designed minimum distance
- A simple approach for construction of algebraic-geometric codes from affine plane curves
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Construction and decoding of a class of algebraic geometry codes
- A class of constacyclic codes
- Fast decoding of algebraic-geometric codes up to the designed minimum distance
- Improved geometric Goppa codes. I. Basic theory
- Decoding of codes defined by a single point on a curve
- Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases
- Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
- Unique Decoding of Plane AG Codes via Interpolation
- UNIQUE DECODING OF PLANE AG CODES REVISITED
- Shift-register synthesis and BCH decoding
- Polynomial weights and code constructions
- On the decoding of algebraic-geometric codes
