HELP: a sparse error locator polynomial for BCH codes
DOI10.1007/S00200-020-00427-XzbMATH Open1458.94327OpenAlexW3017380014MaRDI QIDQ780362FDOQ780362
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
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
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)
Cites Work
- Algebraic coding theory
- Fundamentals of Error-Correcting Codes
- Solving zero-dimensional systems through the rational univariate representation
- Use of Grobner bases to decode binary cyclic codes up to the true minimum distance
- General principles for the algebraic decoding of cyclic codes
- Gröbner Bases, Coding, and Cryptography
- From algebraic sets to monomial linear bases by means of combinatorial algorithms
- The lex game and some applications
- Title not available (Why is that?)
- Finding BCH error locator polynomials in one step
- Properties of Gröbner bases under specializations
- Encoding and error-correction procedures for the Bose-Chaudhuri codes
- GRÖBNER BASIS TECHNIQUES TO COMPUTE WEIGHT DISTRIBUTIONS OF SHORTENED CYCLIC CODES
- On the decoding of cyclic codes using Gröbner bases
- The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gröbner shape theorem
- General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n < 63$</tex></formula>
- Title not available (Why is that?)
- Correcting errors and erasures via the syndrome variety
- On the stability of Gröbner bases under specializations
- Solving systems of algebraic equations by using gröbner bases
- Bezoutian and quotient ring structure
- Title not available (Why is that?)
- Solving Polynomial Equation Systems
- Multivariate interpolation and standard bases for Macaulay modules
- Bar code for monomial ideals
- Vector space bases associated to vanishing ideals of points
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- The big mother of all dualities. 2: Macaulay bases
Cited In (6)
- 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(24)
- Degröbnerization: a political manifesto
- Decoding cyclic codes: the Cooper philosophy
Uses Software
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)
