A Note on the Generalisation of the Guruswami–Sudan List Decoding Algorithm to Reed–Muller Codes

DOI10.1007/978-3-540-93806-4_27zbMath1177.94208OpenAlexW2108432395MaRDI QIDQ3652836

Michael Stepanov, Daniel Augot

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_27

Mathematics Subject Classification ID

Decoding (94B35)

Related Items (3)

Weighted Reed-Muller codes revisited ⋮ Generalized Sudan’s List Decoding for Order Domain Codes ⋮ More results on the number of zeros of multiplicity at least \(r\)

This page was built for publication: A Note on the Generalisation of the Guruswami–Sudan List Decoding Algorithm to Reed–Muller Codes