3 - Error Detection and Correction Flashcards Preview

ECE 487 > 3 - Error Detection and Correction > Flashcards

Flashcards in 3 - Error Detection and Correction Deck (9):
1

What is a burst error?

2 or more bits in the data unit have been received erroneously.

2

What is the Hamming distance between two words?

Number of differences between corresponding bits.

3

What is the minimum Hamming distance?

Smallest Hamming distance between all possible pairs in a set of words.

4

What minimum Hamming distance is used to guarantee DETECTION of s errors?

s + 1.

5

What minimum Hamming distance is used to guarantee CORRECTION of t errors?

2t + 1.

6

What is a linear block code?

A code in which the XOR of two valid codewords creates another valid codeword.

7

What is a simple parity check code? How many errors can it detect?

Single bit error detecting code with 1 redundant bit and a minimum Hamming distance of 2.

Can detect an odd number of errors.

8

What is the relationship between number of check bits and number of bits in a codeword for a minimum Hamming distance of 3?

n = 2^m - 1

n is codeword bits
m is check bits

9

Where is the checksum used?

In the network and transport layers.