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