Decoding binary Reed-Muller codes via Groebner bases

2018/08/29 by Harinaivo Andriatahiny, Andriatahiny, Harinaivo, Jean Jacques Ferdinand Randriamiarampanahy +3 · 1 citation
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · Mathematics · #12E05 #13P10 #94B05 #94B35 #Coding theory and cryptography #DNA and Biological Computing #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #graph theory and CDMA systems #math.IT #msc:12E05 #msc:13P10 #msc:94B05 #msc:94B35

paper · pdf · doi:10.48550/arxiv.1808.09616

arxiv created 2018/08/29 · openalex publication_date 2018/08/29 · arxiv updated 2018/08/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The binary Reed-Muller codes can be characterized as the radical powers of a modular algebra. We use the Groebner bases to decode these codes.

Cited by

• A decoding algorithm for binary linear codes using Groebner bases

Related

• The Generalized Reed-Muller codes and the radical powers of a modular algebra
• A decoding algorithm for binary linear codes using Groebner bases
• New descriptions of the weighted Reed-Muller codes and the homogeneous Reed-Muller codes
• List Decoding of Reed-Solomon Codes from a Groebner Basis Perspective
• Reed-Muller Codes: Theory and Algorithms