Section 5: Error Detection and Correction Flashcards

1
Q

Q: What is a parity bit, and what does it do?

A

A: A bit added to data to ensure the total number of 1s is even (even parity) or odd (odd parity), used to detect single-bit errors.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Q: What is the Hamming code?

A

A: A method for detecting and correcting single-bit errors using minimal redundancy.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Q: What is the Hamming distance, and why is it important?

A

A: The number of differing bits between two codewords. It determines how many errors can be detected or corrected:

1. c+1 detects cc-bit errors.
2. 2c+1 corrects cc-bit errors.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Q: How are parity bits positioned in Hamming code?

A

A: At positions 2^i (e.g., 1, 2, 4, 8). The remaining bits hold the data.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly