Теория Информации #1

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

• A) Parity bits

• B) Error syndrome

• C) Data bits

• D) None of the given

... is a measure of uncertainty

• A) Encoding

• B) Entropy

• C) Information

• D) Redundancy

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

• A) 101

• B) 010

• C) 001

• D) None

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

• A) 101

• B) 010

• C) 100

• D) None

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

• A) 010

• B) 101

• C) 000

• D) None

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

• A) 101

• B) 010

• C) 111

• D) None

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

• A) 010

• B) 101

• C) 011

• D) None distance for code that can detect 3

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

• A) 010

• B) 101

• C) 110

• D) None

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

• A) data; parity

• B) with errors; without errors

• C) allowable; not allowable

• D) 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

• A) 2.1 bit

• B) 1.9 bit

• C) 2.0 bit

• D) 8.0 bit