@newdreamz a1-z0 where to read about it?

The Gateway to Computer Science Excellence

+1 vote

**as 7 message bits are given**

**so $2^{P}$>=m+P+1. {P=number of parity bits ; m=number of message bits ; 1 is the case when there is no error}**

**$2^{P}$>=7+P+1. **

**minimum value of P is 4 which is satisfying it.**

**sent message format will be**

P1 | P2 | 1 | P3 | 0 | 0 | 1 | P4 | 0 | 0 | 0 |

odd parity is given (**here odd parity is for odd number of zeros)**

**for P1:**

[P1, 1, 0, 1, 0, 0]. => P1 is ''1''

**for P2:**

[P2, 1, 0, 1, 0, 0]. => P2 is "1"

**for P3:**

[P3, 0, 0, 0, 0]. => P3 is "0"

**for P4:**

** ** [P4, 0, 0, 0]. => P4 is "1"

so final code that will be sent is

1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 |

**(C) is the answer.**

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,394 answers

198,595 comments

105,446 users