Channel
Instructions
    Quick theory overview:
  • The decoder seeks to find \( \boldsymbol{x} \) which maximizes the probability \( p(\boldsymbol{y} \mid \boldsymbol{x})\):

    \(\hat{x}=\arg_{\boldsymbol{x}\in{\cal C}}\max p(\boldsymbol{y} \mid \boldsymbol{x})\)


    Procedure:
  • Step 1: Select the option corresponding to the correct message(s) passed in this round of peeling decoding for the given Tanner graph.
  • Step 2: Click on "Submit" to check your answer. After submitting, the observation box will provide feedback on your answer.
  • Step 3: If your answer is incorrect, you can try again by selecting another option and clicking on "Submit". If your answer is correct, you can reset the question by clicking on the "Reset" button.
  • Step 4: You can proceed to the next subexperiment by clicking on the "Peeling Decoder" tab.

Consider the Tanner graph below. Messages are being passed from right to left in this round of peeling decoding. Identify the messages in this round by selecting the right option.

 

Observations