On the evaluation codes given by simple -sequences

DOI10.1007/S00200-015-0271-6MaRDI QIDQ2634585zbMATH OpenOpenAlexFDO

Authors R. Pérez-Casales, Carlos Galindo

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

zbMATH Keywords

coset boundevaluation codeorder domainsimple \(\delta \)-sequencevaluation at infinity

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Recommendations

• δ-sequences and evaluation codes defined by plane valuations at infinity
• Valuation and discrete valuation codes
• Evaluation codes defined by finite families of plane valuations at infinity
• Evaluation codes and their basic parameters
• Evaluation codes and plane valuations

Cites work

• A class of constacyclic codes
• A simple approach for construction of algebraic-geometric codes from affine plane curves
• Algebraic coding theory
• Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases
• Algebroid curves in positive characteristic
• Codes and information
• Computing Weierstrass semigroups and the Feng-Rao distance from singular plane models
• Construction and decoding of a class of algebraic geometry codes
• Coset bounds for algebraic geometric codes
• Decoding affine variety codes using Gröbner bases
• Decoding algebraic-geometric codes up to the designed minimum distance
• Decoding of codes defined by a single point on a curve
• Duality for some families of correction capability optimized evaluation codes
• Evaluation codes and plane valuations
• Evaluation codes defined by finite families of plane valuations at infinity
• Evaluation codes from order domain theory
• Extension of the Berlekamp-Massey algorithm to N dimensions
• Fast decoding of algebraic-geometric codes up to the designed minimum distance
• Fast decoding of codes from algebraic plane curves
• Feng-Rao decoding of primary codes
• Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
• How to share a secret
• scientific article; zbMATH DE number 3427498 (Why is no real title available?)
• scientific article; zbMATH DE number 1206418 (Why is no real title available?)
• scientific article; zbMATH DE number 1284423 (Why is no real title available?)
• scientific article; zbMATH DE number 503203 (Why is no real title available?)
• scientific article; zbMATH DE number 2081133 (Why is no real title available?)
• scientific article; zbMATH DE number 3196340 (Why is no real title available?)
• Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
• Improved decoding of affine-variety codes
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Improved geometric Goppa codes. I. Basic theory
• Lectures on expansion techniques in algebraic geometry. With notes by Balwant Singh
• List decoding algorithm based on voting in Gröbner bases for general one-point AG codes
• Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
• New quantum codes from evaluation and matrix-product codes
• On the decoding of algebraic-geometric codes
• On the structure of order domains
• Polynomial weights and code constructions
• Quantum codes from affine variety codes and their subfield-subcodes
• Shift-register synthesis and BCH decoding
• Stabilizer quantum codes from \(J\)-affine variety codes and a new Steane-like enlargement
• The Abhyankar-Moh theorem for plane valuations at infinity
• The BMS Algorithm
• The BMS Algorithm and Decoding of AG Codes
• Unique Decoding of General AG Codes
• Unique decoding of plane AG codes revisited
• Unique Decoding of Plane AG Codes via Interpolation
• Valuations in Function Fields of Surfaces
• δ-sequences and evaluation codes defined by plane valuations at infinity

Cited in

(3)

• On the distance of stabilizer quantum codes from \(J\)-affine variety codes
• Evaluation codes defined by finite families of plane valuations at infinity
• δ-sequences and evaluation codes defined by plane valuations at infinity

This page was built for publication: On the evaluation codes given by simple \(\delta \)-sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2634585)