HELP: a sparse error locator polynomial for BCH codes

DOI10.1007/S00200-020-00427-XMaRDI QIDQ780362zbMATH OpenOpenAlexFDO

Authors Michela Ceria, Massimiliano Sala, Ferdinando Mora

Publication date 15 July 2020

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-020-00427-x

zbMATH Keywords

cyclic codeslocator polynomialsyndrome variety

Mathematics Subject Classification ID

Combinatorial aspects of commutative algebra (05E40) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Cyclic codes (94B15) Decoding (94B35)

Recommendations

• Decoding cyclic codes: the Cooper philosophy
• On the decoding of cyclic codes using Gröbner bases
• scientific article; zbMATH DE number 1276822
• General principles for the algebraic decoding of cyclic codes
• The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gröbner shape theorem

Cites work

• scientific article; zbMATH DE number 691462 (Why is no real title available?)
• scientific article; zbMATH DE number 1952043 (Why is no real title available?)
• scientific article; zbMATH DE number 2166957 (Why is no real title available?)
• A proof of the ``Axis of Evil Theorem for distinct points
• Algebraic coding theory
• An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
• Bar code for monomial ideals
• Bezoutian and quotient ring structure
• Correcting errors and erasures via the syndrome variety
• Encoding and error-correction procedures for the Bose-Chaudhuri codes
• Finding BCH error locator polynomials in one step
• From algebraic sets to monomial linear bases by means of combinatorial algorithms
• Fundamentals of Error-Correcting Codes
• GRÖBNER BASIS TECHNIQUES TO COMPUTE WEIGHT DISTRIBUTIONS OF SHORTENED CYCLIC CODES
• General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n &lt; 63$</tex></formula>
• General principles for the algebraic decoding of cyclic codes
• Gröbner Bases, Coding, and Cryptography
• Multivariate interpolation and standard bases for Macaulay modules
• On the Shape of the General Error Locator Polynomial for Cyclic Codes
• On the decoding of cyclic codes using Gröbner bases
• On the stability of Gröbner bases under specializations
• Properties of Gröbner bases under specializations
• Solving polynomial equation systems. Vol. III: Algebraic solving
• Solving polynomial equation systems. Vol. IV. Buchberger theory and beyond
• Solving systems of algebraic equations by using Gröbner bases
• Solving zero-dimensional systems through the rational univariate representation
• The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gröbner shape theorem
• The big mother of all dualities. 2: Macaulay bases
• The lex game and some applications
• Use of Grobner bases to decode binary cyclic codes up to the true minimum distance
• Vector space bases associated to vanishing ideals of points

Cited in

(6)

• Decoding cyclic codes: the Cooper philosophy
• Towards a Gröbner-free approach to coding
• A commutative algebra approach to linear codes
• Oracle-supported drawing of the Gröbner \textit{escalier}
• Decoding the triple-error-correcting (15, 5) binary BCH code by the analytic solution of the cubic error-locator polynomial over GF(2⁴)
• Degröbnerization: a political manifesto

Describes a project that uses

Uses Software

• ISOLATE

This page was built for publication: HELP: a sparse error locator polynomial for BCH codes

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