Information Theory 1-30

______ indicate(s) an error in a received combination.

• Parity bits

• Error syndrome

• Data bits

• None of the given

... is a measure of uncertainty

• Encoding

• Entropy

• Information

• Redundancy

A code has two allowable combinations 101 and 010. What is the allowable combination for the error combination 001?

• 101

• 010

• 001

• None

A code has two allowable combinations 101 and 010. What is the allowable combination for the error combination 100?

• 101

• 010

• 100

• None

A code has two allowable combinations 101 and 010. What is the allowable combination for the error combination 000?

• 010

• 101

• 000

• None

A code has two allowable combinations 101 and 010. What is the allowable combination for the error combination 111?

• 101

• 010

• 111

• None

A code has two allowable combinations 101 and 010. What is the allowable combination for the error combination 011?

• 010

• 101

• 011

• None

A code has two allowable combinations 101 and 010. What is the allowable combination for the error combination 110?

• 010

• 101

• 110

• None

A codeword of the Hamming code consists of ________ and ________ bits.

• data; parity

• with errors; without errors

• allowable; not allowable

• none of the given

A Huffman code is a = 1, b = 000, c = 001, d = 01. Probabilities are p(a) = 0.4, p(b) = 0.1, p(c) = 0.2, p(d) = 0.3. The average length of codewords q is

• 2.1 bit

• 1.9 bit

• 2.0 bit

• 8.0 bit