WorksheetsHamming Code and Information Theory Quiz
Total questions: 53
Worksheet time: 27mins
Specify the error position in the string "1001110", if the initial string was encoded with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)
r1
no error
r2
i4
Specify the error position in the string "1001111", if the initial string was encoded with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)
r1
r3
r2
i4
Specify the error position in the string "1011110", if the initial string was encoded with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)
i1
i3
i2
i4
Specify the error position in the string "1101110", if the initial string was encoded with Hamming (7,4) code using the following structure (i1, i2, i3, i4, r1, r2, r3)
i1
i2
i3
i4
Specify the formula to find the amount of information if events have different probabilities.
Hartley's formula
Shannon's formula
Fano's formula
Bayes' formula
Specify the formula to find the amount of information if events have the same probabilities.
Shannon's formula
Hartley's formula
Fano's formula
Bayes' formula
Specify the right formula if dmin is Hamming distance, s - number of correctable errors and r - number of detecteable errors.
dmin>= s+r+1
dmin>= 2s+r+1
dmin>= s+2r+1
dmin>= s+r+2
Suppose the letters a, b, c, d, e, f have probabilities 1/2, 1/4, 1/8, 1/16, 1/32, 1/32 respectively. Which of the following is the Huffman code for the letter a, b, c, d, e, f?
11, 10, 011, 010, 001, 000
0, 10, 110, 1110, 11110, 11111
11, 10, 01, 001, 0001, 0000
110, 100, 010, 000, 001, 111
Suppose the letters a, b, c, d, e, f have probabilities 1/2, 1/4, 1/8, 1/16, 1/32, 1/32 respectively. What is the average length q of the Huffman code?
3,0
1,9
2,7
4,3
The amount of information in the message is 120 bits. Calculate the length of this message, which is written by characters of 16-character alphabet.
30
480
120
130
The amount of information in the message is 60 bits. Calculate the length of this message, which is written by characters of 4-character alphabet.
30
60
15
510
The basic idea behind Shannon-Fano coding is to
compress data by using more bits to encode more frequently occuring characters
compress data by using fewer bits to encode more frequently occuring characters
compress data by using fewer bits to encode fewer frequently occuring characters
expand data by using fewer bits to encode more frequently occuring characters
The efficiency of the language is 0,25 and its I average is 1 bit. Calculate the number of letters in this language's alphabet?
32
16
8
64
The first code combination is 0000 and the Hamming distance of this code equals 4. Choose the second combination.
1111
1011
0011
0000
The Hamming code is a method of _______.
Error control coding
Optimal coding
None of the above
The Hamming distance between "client" and "server" is
0
1
6
impossible to detect
The Hamming distance between "make" and "made" is
4
3
1
impossible to detect
The Hamming distance between "push" and "pull" is
0
4
2
impossible to detect
The Hamming distance between "starting" and "finishing" is
4
3
impossible to detect
5
The Hamming distance between 001111 and 010011 is
1
2
3
4
The Hamming distance between 010111 and 010011 is
2
3
1
4
The Hamming distance between 011111 and 010011 is
1
3
2
4
The Hamming distance between 101001 and 010011 is
1
2
4
3
The length of the message is 16 symbols and the message's alphabet consists of 32 symbols. Find the amount of information in this message.
80
16
64
32
The length of the message is 6 symbols and the message's alphabet consists of 32 symbols. Find the amount of information in this message.
30
6
32
24
The redundancy of the language is 0,75 and its I average is 1 bit. Calculate the number of letters in this language's alphabet?
32
16
8
64
The string was encoded with Hamming (7,4) code using the structure (i1, i2, i3, i4, r1, r2, r3). After a channel the error syndrome is 000. Specify the position of the error.
i1
r1
no error
r3
The string was encoded with Hamming (7,4) code using the structure (i1, i2, i3, i4, r1, r2, r3). After a channel the error syndrome is 001. Specify the position of the error.
i1
r1
r3
no error
The string was encoded with Hamming (7,4) code using the structure (i1, i2, i3, i4, r1, r2, r3). After a channel the error syndrome is 001. Specify the position of the error.
i1
r1
r3
no error
The string was encoded with Hamming (7,4) code using the structure (i1, i2, i3, i4, r1, r2, r3). After a channel the error syndrome is 010. Specify the position of the error.
r3
r1
r2
i2
The string was encoded with Hamming (7,4) code using the structure (i1, i2, i3, i4, r1, r2, r3). After a channel the error syndrome is 011. Specify the position of the error.
r4
i1
i4
r1
The string was encoded with Hamming (7,4) code using the structure (i1, i2, i3, i4, r1, r2, r3). After a channel the error syndrome is 100. Specify the position of the error.
r3
i1
r1
r2
The string was encoded with Hamming (7,4) code using the structure (i1, i2, i3, i4, r1, r2, r3). After a channel the error syndrome is 101. Specify the position of the error.
no error
r1
i1
i2
The string was encoded with Hamming (7,4) code using the structure (i1, i2, i3, i4, r1, r2, r3). After a channel the error syndrome is 110. Specify the position of the error.
i4
r3
i3
i1
The string was encoded with Hamming (7,4) code using the structure (i1, i2, i3, i4, r1, r2, r3). After a channel the error syndrome is 111. Specify the position of the error.
i4
r2
i2
no error
This is the method for data processing for reducing errors during transmission via channel with noise.
Error Correction code
Uniform code
Non-uniform code
Optimal code
We can divide coding schemes into two broad categories: ________ and ______coding.
block; linear
linear; nonlinear
block; convolution
none of the given
What is the first step of Shannon-Fano algorithm?
Characters of the original alphabet are setted in descending order of probability.
Letters divided to the two subsets so that the overall probability of these subsets were about equal.
For all characters (letters) of the top subset assign a code element 1, and for characters of the lower subset the 0 code.
For all characters (letters) of the top subset assign a code element 0, and for characters of the lower subset the 1 code.
What is the Hamming distance between two strings of equal length?
the number of positions at which the corresponding symbols are different
the number of positions at which the corresponding symbols are equal
the number of identical symbols in the first string
the number of identical symbols in the second string
What is the meaning of number “2” in the formula I = n*log2m?
Binary number system
Message length equals to 2
It hasn’t any meaning
Information is measured in nits
What is the sample space of one dice roll?
{1,2,3,4,5,6}
{1,3,5}
{2,4,6}
{1,2,3,4,5,6,7,8,9,10,11,12}
When the base of the logarithm is 10, then the unit of measure of information is
bytes
dits
nits
bits
When the base of the logarithm is 2, then the unit of measure of information is
bytes
bits
nits
dits
When the base of the logarithm is e, then the unit of measure of information is
bytes
nits
dits
bits
Which letter will get the shortest codeword after Huffman coding of the word "abracadabra"?
c
r
d
a
Which of the following codes can be the Huffman code for the letters a,b,c,d,e?
10,011,11,001,010
0,10,110,1110,1111
10,01,0001,100,1010
100,110,001,000,010
Which of the following codes has the highest code rate?
code rate is constant for all of the Hamming codes
Hamming (31,26)
Hamming (15,11)
Hamming (7,4)
Which of the following codes has the highest redundancy?
redundancy is constant for all of the Hamming codes
Hamming (7,4)
Hamming (15,11)
Hamming (31,26)
Which of the following codes is prefix?
0, 111, 11
0, 111, 10
0, 101, 10
00, 10, 101
Which of the following codes is prefix?
0, 01, 11
0, 10, 11
0, 10, 1
0, 01, 001
Which of the following codes is uniform?
ASCII
Shannon-Fano
Huffman
None of the given
Which of the following codes is uniform?
10,011,11,001,010
0,10,110,1110,1111
10,01,0001,100,1010
100,110,001,000,010
Which of the following symbols will get the shortest codeword after Shannon-Fano coding if probabilities are p(a) = 0.05, p(b) = 0.6, p(c) = 0.2 and p(d) = 0.15?
c
a
d
b
