in question, it wasn't mentioned about error correction or detection, so what needs to be assumed ?

The Gateway to Computer Science Excellence

+2 votes

To provide more reliability than the Single Parity Bit technique, a new error-detecting scheme has been proposed. The scheme uses first parity bit for checking all the odd numbered bits and a second parity bit for all the even numbered bits. What is the (minimum) Hamming distance of this code ?

+4 votes

Best answer

Here we need to know :

a) Minimum Hamming distance needed to detect 'd' errors = d + 1

b) Minimum Hamming distance needed to correct 'd' errors = 2d + 1

c) A simple parity scheme has one bit error detecting capability

In the modified parity scheme , we can detect two errors as we are using two separate parity bits ; one for checking bits at odd-numbered positions and other at even numbered positions.

Hence number of errors that can be detected = 2 (corresponding to each parity bit we have one error which can be detected)

**Hence minimum hamming distance needed for error detection = d + 1 = 2 + 1 = 3**

** minimum hamming distance needed for error correction = 2d + 1 = 2(2) + 1 = 5**

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

50,648 questions

56,422 answers

195,194 comments

99,834 users