Gröbner Bases, Coding, and Cryptography

DOI10.1007/978-3-540-93806-4MaRDI QIDQ3598191zbMATH OpenOpenAlexFDO

Authors

Publication date 2 February 2009

Full work available at URL https://doi.org/10.1007/978-3-540-93806-4

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to algebraic geometry (14-06) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06) Proceedings, conferences, collections, etc. pertaining to commutative algebra (13-06)

Cited in

(25)

• Minimum distance functions of complete intersections
• Degröbnerization: a political manifesto
• On the subfield subcodes of Hermitian codes
• An algebraic characterization of 𝑘–colorability
• A Fitzpatrick algorithm for multivariate rational interpolation
• scientific article; zbMATH DE number 493097 (Why is no real title available?)
• HELP: a sparse error locator polynomial for BCH codes
• scientific article; zbMATH DE number 1163423 (Why is no real title available?)
• Polly cracker, revisited
• Gröbner Bases, Coding, and Cryptography: a Guide to the State-of-Art
• A two-dimensional improvement for Farr-Gao algorithm
• Gröbner basis cryptosystems
• Solving non-linear Boolean equation systems by variable elimination
• Rough ideals under relations associated to fuzzy ideals
• On ideal lattices, Gröbner bases and generalized hash functions
• scientific article; zbMATH DE number 68553 (Why is no real title available?)
• A primer on ideal theoretical operation in non-commutative polynomial rings
• On the decoding of the \((24, 12, 8)\) Golay code
• The Fitzpatrick-Neville-type algorithm for multivariate vector-valued osculatory rational interpolation
• 1-generator quasi-cyclic codes over finite chain rings
• Sage: A Basic Overview for Coding Theory and Cryptography
• Generalised Jacobians in Cryptography and Coding Theory
• The Neville-like form of the Fitzpatrick algorithm for rational interpolation
• Parametric FGLM algorithm
• A feasibility approach for constructing combinatorial designs of circulant type

This page was built for publication: Gröbner Bases, Coding, and Cryptography

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