Pratidin
2026 · Electrical Engineering Optional Paper II · 10 marksMainsQuestion 7bii

A parity check code has the parity check matrix :
H = [1 0 1 1 0 0; 1 1 0 0 1 0; 0 1 1 0 0 1]
(rows: 1 0 1 1 0 0 / 1 1 0 0 1 0 / 0 1 1 0 0 1)
I. Determine the generator matrix G.
II. Find the code word that begins with 101... .
III. Suppose that the received word is 110110. Decode this received word.

10 marks · directive: Determine

Answer

The core of a good answer

Since H = [Pᵀ | I₃] with Pᵀ = [1 0 1; 1 1 0; 0 1 1], the generator matrix is G = [I₃ | P] = [1 0 0 1 1 0; 0 1 0 0 1 1; 0 0 1 1 0 1]; the codeword for 101 is 101011; the received word 110110 has syndrome 011, which matches column 2 of H, so the second bit is in error and the decoded codeword is 100110 (message 100).

An outline written by upsc.help, not an official UPSC answer; every fact checked by a separate review. How we work

What the question asks

This is a (6, 3) systematic linear block code. The method: identify the parity submatrix from H, write G = [I_k | P], encode by c = mG, and decode by the syndrome s = rHᵀ, matching it to a column of H for single error correction.

Answer outline

Introduction

H is 3 × 6 with the identity in its last three columns, so n = 6, k = 3, n − k = 3. The code is in systematic form with message bits first and parity bits last. All arithmetic is modulo 2.

Step 1: Identify P

Step 2: Generator matrix, part I

Step 3: Parity equations

Step 4: Codeword beginning with 101, part II

Step 5: Syndrome of the received word, part III

Step 6: Error location and correction

Conclusion

G = [1 0 0 1 1 0; 0 1 0 0 1 1; 0 0 1 1 0 1]; the codeword for 101 is 101011; 110110 decodes to 100110 (message 100). The code has minimum distance 3 (all six columns of H are distinct and non zero), so it corrects any single error.

Examples and data to cite

Facts

Facts to remember

Sources used for the explanation

Write a timed answer in the app