Gröbner Bases over Commutative Rings and Applications to Coding Theory
From MaRDI portal
Publication:3652821
DOI10.1007/978-3-540-93806-4_14zbMath1179.13019MaRDI QIDQ3652821
Publication date: 16 December 2009
Published in: Gröbner Bases, Coding, and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-93806-4_14
Gröbner bases; alternant codes; Galois ring; Berlekamp-Massey algorithm; Buchberger's algorithm; commutative rings; decoding algorithms; list decoding; finite chain rings; FGLM algorithm; key-equation; solution module; Szekeres-like bases
94A60: Cryptography
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
94B35: Decoding
Related Items
A primer on ideal theoretical operation in non-commutative polynomial rings, Standard bases in mixed power series and polynomial rings over rings, Lattice of ideals of the polynomial ring over a commutative chain ring, Algebraic decoding of negacyclic codes over \({\mathbb Z_4}\), Buchberger-Zacharias theory of multivariate Ore extensions, Zacharias representation of effective associative rings
Uses Software