A binary linear systematic (10, 6, 3) code C has generator-check matrix 100 000 1 1...

 

Transcribed Image Text:

A binary linear systematic (10, 6, 3) code C has generator-check matrix 100 000 1 1 00 0100000 1 10 001 0 0 0 0 0 1 1 0 0 0 1 0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 0 0 0 0 0 1 0 1 0 1 G = (a) Build a look-up table with 5 and è as shown in the lecture (b) Suppose that the received vector is 7 = = (1 1 0 0 1 0 1 0 1 0). Compute its syndrome 5 and, using the look-up-table in part (a), determine the most likely information bit vector sent B A binary linear systematic (10, 6, 3) code C has generator-check matrix 100 000 1 1 00 0100000 1 10 001 0 0 0 0 0 1 1 0 0 0 1 0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 0 0 0 0 0 1 0 1 0 1 G = (a) Build a look-up table with 5 and è as shown in the lecture (b) Suppose that the received vector is 7 = = (1 1 0 0 1 0 1 0 1 0). Compute its syndrome 5 and, using the look-up-table in part (a), determine the most likely information bit vector sent B

Answer rating: 100% (QA)

This prints the following table 0 1 0 1 0 0 0 1 0 ... View the full answer