Majority Logic Decoding of Reed-Muller Codes
An code has a minimum distance . What is its error correction capability for majority logic decoding?
What is the primary algebraic purpose of summing a polynomial's evaluations over a check set ?
When decoding an code, how many disjoint check sets are used to vote for a single degree-3 coefficient (e.g., )?
In the iterative decoding algorithm, what is the purpose of the 'peel off' step (calculating )?
You are decoding an vector (which has ). For the coefficient , the four check-sum estimates are . What is the decoded coefficient ?