This problem concerns the code based on the 31-hat game. Here the message should be decomposed into blocks of length 31 − 5 = 26. Suppose that one of the 26-blocks in the starting message has eight 0s followed by eleven 12s, followed by four 0s, then a 1 and finally two 0's.
That is: M = 00000000111111111110000100.
(a) Find its associated L-node, which is the code word which will be transmitted.
(b) Suppose that in the transmission, there is an error in the 17th character. Give a detailed account of the calculations made by the decoder to recover the original message.
The below images are an example from last year, just with the values changed, still confused though please help!