Consider a code represented by the parity-check matrix of Figure E7.19 (this is obviously not an…


Consider a adjudication represented by the parity-check matrix of Figure E7.19 (this is obviously not an explicit low-density matrix, but it is single-minded ample to suffer the decoding progress to be manufactured by agency).

a. What are this adjudication’s n, m, k, wrow, and wcol parameters?

b. Draw the corresponding Tanner graph.

c. Show that this graph contains a 4-pass cycle.

d. Check whether the adjudication signification "00111100" and "00111000" appertain to this adjudication.

e. Suppose that the adjudicationword "00111100" is current by the decoder. Deadjudication it using the belief-propagation progress feeling in Figure 7.21. Compare the result after a while your defense in allot (d) over.

f. Repeat allot (e) over for the condition when "00111000" is current. Even though this adjudicationword has merely one deception, can this decoder reform it?