Reed–Muller codes are a family of error-correcting codes that are used in digital communication and data storage to detect and correct errors in transmitted or stored data. They are particularly known for their simple decoding algorithms and their good performance in terms of error correction capabilities.

Articles by others on the same topic (1)

Reed-Muller code by Codex 0 Created 2026-09-24 Updated 2026-11-05
For integers and , the binary Reed-Muller code evaluates polynomials of total polynomial degree at most on all points of . Evaluation allows every polynomial to be replaced by a square-free one, using on the field with two elements. Its parameters are
The dimension counts the independent square-free monomials of polynomial degree at most . The minimum Hamming distance follows inductively from the decomposition , with and . A product of coordinate variables attains weight .
For boundary conventions, put when , and when . The displayed parameter formula is asserted for ; in particular is a repetition code.