Towards a Gröbner-free approach to coding

DOI10.1007/S10623-023-01302-9MaRDI QIDQ6146596zbMATH OpenOpenAlexFDO

Authors Michela Ceria, Ferdinando Mora

Publication date 15 January 2024

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-023-01302-9

zbMATH Keywords

cyclic codesdegröbnerizationlocator 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

• On the decoding of cyclic codes using Gröbner bases
• Decoding cyclic codes: the Cooper philosophy
• Gröbner bases and distance of cyclic codes
• scientific article; zbMATH DE number 1276822
• General principles for the algebraic decoding of cyclic codes

Cites work

• A proof of the ``Axis of Evil Theorem for distinct points
• A remark on a remark by Macaulay or enhancing Lazard structural theorem
• Algebraic coding theory
• Applications of bar code to involutive divisions and a ``greedy algorithm for complete sets
• Bar code for monomial ideals
• Bar code: a visual representation for finite sets of terms and its applications
• Combinatorial algorithms for the interpolation of polynomials in dimension 2
• Correcting errors and erasures via the syndrome variety
• De nugis Groebnerialium. II: Applying Macaulay's trick in order to easily write a Gröbner basis
• Degröbnerization: a political manifesto
• Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals
• 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
• General principles for the algebraic decoding of cyclic codes
• Gröbner bases of ideals defined by functionals with an application to ideals of projective points
• HELP: a sparse error locator polynomial for BCH codes
• scientific article; zbMATH DE number 3876580 (Why is no real title available?)
• scientific article; zbMATH DE number 1254248 (Why is no real title available?)
• scientific article; zbMATH DE number 1273641 (Why is no real title available?)
• 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 1504686 (Why is no real title available?)
• Ideal basis and primary decompositions: case of two variables
• Invited Talk: Decoding Cyclic Codes: The Cooper Philosophy
• Matrix multiplication via arithmetic progressions
• Multivariate interpolation and standard bases for Macaulay modules
• On the decoding of cyclic codes using Gröbner bases
• On the Shape of the General Error Locator Polynomial for Cyclic Codes
• Properties of Gröbner bases under specializations
• Solving systems of algebraic equations by using Gröbner bases
• The big mother of all dualities. 2: Macaulay bases
• The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gröbner shape theorem
• 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
• Zech tableaux as tools for sparse decoding

This page was built for publication: Towards a Gröbner-free approach to coding

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