HELP: a sparse error locator polynomial for BCH codes

DOI10.1007/S00200-020-00427-XzbMath1458.94327OpenAlexW3017380014MaRDI QIDQ780362

Massimiliano Sala, Michela Ceria, 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

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

Related Items (2)

Towards a Gröbner-free approach to coding ⋮ Degröbnerization: a political manifesto

Uses Software

• ISOLATE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correcting errors and erasures via the syndrome variety
• The big mother of all dualities. 2: Macaulay bases
• Solving zero-dimensional systems through the rational univariate representation
• On the stability of Gröbner bases under specializations
• On the decoding of cyclic codes using Gröbner bases
• Multivariate interpolation and standard bases for Macaulay modules
• The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gröbner shape theorem
• From algebraic sets to monomial linear bases by means of combinatorial algorithms
• Bar code for monomial ideals
• Bezoutian and quotient ring structure
• The lex game and some applications
• Vector space bases associated to vanishing ideals of points
• Finding BCH error locator polynomials in one step
• Solving Polynomial Equation Systems
• 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>
• Fundamentals of Error-Correcting Codes
• GRÖBNER BASIS TECHNIQUES TO COMPUTE WEIGHT DISTRIBUTIONS OF SHORTENED CYCLIC CODES
• Gröbner Bases, Coding, and Cryptography
• Use of Grobner bases to decode binary cyclic codes up to the true minimum distance
• General principles for the algebraic decoding of cyclic codes
• An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
• On the Shape of the General Error Locator Polynomial for Cyclic Codes
• Solving systems of algebraic equations by using gröbner bases
• Properties of Gröbner bases under specializations
• Encoding and error-correction procedures for the Bose-Chaudhuri codes

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