Decoding Linear Error-Correcting Codes up to Half the Minimum Distance with Gröbner Bases

DOI10.1007/978-3-540-93806-4_21zbMath1177.94210OpenAlexW1547408159MaRDI QIDQ3652828

Stanislav Bulygin, Pellikaan, Ruud

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_21

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Decoding (94B35)

Related Items (3)

On the subfield subcodes of Hermitian codes ⋮ Bounded distance decoding of linear error-correcting codes with Gröbner bases ⋮ Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes

This page was built for publication: Decoding Linear Error-Correcting Codes up to Half the Minimum Distance with Gröbner Bases