The Gateway to Computer Science Excellence

+5 votes

Best answer

Given 8 bit word 00111001. encoded in d8=0 d7=0 d6=1 d5=1 d4=1 d3=0 d2=0 d1=1.

Parity is calculated as 01111 which are written as p8p4p2p1.

p1=1

p2=1

p4=1

p8=0.

encode the string as

d8d7d6d5p8d4d3d2p4d1p2p1.

001101001111.

check bit at other end is 1101.

c1=1

c2=0

c4=1

c8=1.

xor(1101,0111)=1010 . its decimal conversion is 10. so 10th bit is changed.

10th bit is d6. so we flip it. and we get

00011001

0

In this encoding process,

We are going to append the check bits in our original strong.

Check bits are positioned using the power of 2, i.e, from right to left it will be 2^0 = 1, 2^1 = 2, 2^2 = 4, 2^3 = 8.

So from right side we reserve 1,2,4,8 positions and the original string will be allocated the rest of the places.

So, we will get -

(start from right to left)

Positions | 12 | 11 | 10 | 9 | 8 | 7 | 6 | 5 | 4 | 3 | 2 | 1 |

Values | d8 | d7 | d6 | d5 | p4 | d4 | d3 | d2 | p3 | d1 | p2 | p1 |

- 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,385 answers

198,560 comments

105,387 users