Professional Documents
Culture Documents
Main Questions
No Negative marking.
Hamming Distance
Block Codes
Systematic Codes
Code Rate
e=0100000, s=100
e=1000000, s=101
e=1000000, s=110
e=0100000, s=111
https://docs.google.com/forms/d/e/1FAIpQLSecn7xs9LIwr86o5V168gUhbKVQrvdtM65oDMaBNvDztTcfbw/formResponse 1/13
7/22/2021 Information and coding theory::PGIT 203:: Semester End Examination:: Academic Session:: 2020-21
For the generation of a cyclic code, the generator polynomial should be ১ পয়েন্ট
x^n + 1
x^n /2
x^n – 1
(x^n-1)/2
A Gaussian channel has a 20 MHz bandwidth of S/N = 100. The channel 3 পয়েন্ট
capacity is
133.18 Mbits/sec
154.60 Mbits/sec
255.48 Mbits/sec
234.87 Mbits/sec
Given that a codeword c of the (7, 4) Hamming code, incurs a single bit ১ পয়েন্ট
011
100
001
101
https://docs.google.com/forms/d/e/1FAIpQLSecn7xs9LIwr86o5V168gUhbKVQrvdtM65oDMaBNvDztTcfbw/formResponse 2/13
7/22/2021 Information and coding theory::PGIT 203:: Semester End Examination:: Academic Session:: 2020-21
For a (7, 4) linear cyclic code generated by the generator polynomial g(X) 3 পয়েন্ট
0010010
0111010
0011010
0011011
3, 4
2, 3
1, 2
1, 3
dₘᵢₙ ≤ n+ k- 1
dₘᵢₙ ≤ n- k+ 1
dₘᵢₙ ≤ n+ k+ 1
dₘᵢₙ ≤ n- k- 1
https://docs.google.com/forms/d/e/1FAIpQLSecn7xs9LIwr86o5V168gUhbKVQrvdtM65oDMaBNvDztTcfbw/formResponse 3/13
7/22/2021 Information and coding theory::PGIT 203:: Semester End Examination:: Academic Session:: 2020-21
The minimum distance dₘᵢₙ of a triple error correcting BCH code is ১ পয়েন্ট
___________
For a (15, 11) cyclic code, the generator matrix obtained from its generator ১ পয়েন্ট
polynomial, will have _________ rows
15
11
always ≤ 0
always ≠ 0
always = 0
always ≥ 0
https://docs.google.com/forms/d/e/1FAIpQLSecn7xs9LIwr86o5V168gUhbKVQrvdtM65oDMaBNvDztTcfbw/formResponse 4/13
7/22/2021 Information and coding theory::PGIT 203:: Semester End Examination:: Academic Session:: 2020-21
will be
unchanged
decreased
increased
doubled
by
Logb (1/pk )
Logb (1/(1-pk ))
Logb (1-pk )
Logb (pk )
P(x1) = 0.4, P(x2) = 0.35 and P(x3) = 0.25 . The efficiency of the source is
87.93 %
90.08 %
97.43 %
88.98 %
https://docs.google.com/forms/d/e/1FAIpQLSecn7xs9LIwr86o5V168gUhbKVQrvdtM65oDMaBNvDztTcfbw/formResponse 5/13
7/22/2021 Information and coding theory::PGIT 203:: Semester End Examination:: Academic Session:: 2020-21
m/n - 1
2ᵐ - 1
(2ᵐ -1)/2
m-n-1
The binary symbols 0 and 1 are transmitted with probabilities 1 and 0 2 পয়েন্ট
0 & 1 bit
1 & undefined
For any positive integers m ≥ 3 and t < 2ᵐ−1, there exists a binary BCH ১ পয়েন্ট
code, there exists a binary BCH code with number of parity-check bits
_____________________
equal to m.t
https://docs.google.com/forms/d/e/1FAIpQLSecn7xs9LIwr86o5V168gUhbKVQrvdtM65oDMaBNvDztTcfbw/formResponse 6/13
7/22/2021 Information and coding theory::PGIT 203:: Semester End Examination:: Academic Session:: 2020-21
as 'Syndrome Polynomial'
Generator Polynomial
Remainder Polynomial
Quotient Polynomial
cannot be constructed
no column is independent
Consider a source X which generates four symbols with probabilities P(x1) 3 পয়েন্ট
= 0.5, P(x2) = 0.3, P(x3) = 0.1 and P(x4) = 0.1. The entropy of the source is
1.91 bits
1.685 bits
2.789 bits
2.009 bits
https://docs.google.com/forms/d/e/1FAIpQLSecn7xs9LIwr86o5V168gUhbKVQrvdtM65oDMaBNvDztTcfbw/formResponse 7/13
7/22/2021 Information and coding theory::PGIT 203:: Semester End Examination:: Academic Session:: 2020-21
The block length of a primitive BCH code constructed over GF(2ᵐ) is ১ পয়েন্ট
_______________
2ᵐ +2
2ᵐ - 1
2ᵐ + 1
2ᵐ
For a (7, 4) linear block code the error syndrome is found to be 011 on ১ পয়েন্ট
111
101
001
011
_______________________________.
https://docs.google.com/forms/d/e/1FAIpQLSecn7xs9LIwr86o5V168gUhbKVQrvdtM65oDMaBNvDztTcfbw/formResponse 8/13
7/22/2021 Information and coding theory::PGIT 203:: Semester End Examination:: Academic Session:: 2020-21
Code efficiency is maximum when average code length L and entropy ১ পয়েন্ট
L=H(X)
L > H(X
L < H(X)
None of these
Amount of information
Rate of information
Measure of uncertainty
Probability of messages
https://docs.google.com/forms/d/e/1FAIpQLSecn7xs9LIwr86o5V168gUhbKVQrvdtM65oDMaBNvDztTcfbw/formResponse 9/13
7/22/2021 Information and coding theory::PGIT 203:: Semester End Examination:: Academic Session:: 2020-21
k = (m-1) k 0
k = (1-m) k 0
k = (m+1) k 0
none of these
If g(x) is the generator polynomial and h(x) is the parity check polynomial ১ পয়েন্ট
g(x)h(x)=1
g(x)h(x)=n+1
g(x)h(x)= x^n + 1
g(x)h(x)=n
A telephone channel has a bandwidth of 3000 Hz and SNR = 25 dB, the 3 পয়েন্ট
channel capacity is
19.97 kbps
24.92 kbps
1.19 kbps
1.19 bps
https://docs.google.com/forms/d/e/1FAIpQLSecn7xs9LIwr86o5V168gUhbKVQrvdtM65oDMaBNvDztTcfbw/formResponse 10/13
7/22/2021 Information and coding theory::PGIT 203:: Semester End Examination:: Academic Session:: 2020-21
For a t-error correcting RS code the degree of the generator polynomial ১ পয়েন্ট
2t-1
t+1
2t
The number of k bit shift over which a single information bit influences the ১ পয়েন্ট
encoder output is given by
Code rate
Code length
Code weight
Constraint length
https://docs.google.com/forms/d/e/1FAIpQLSecn7xs9LIwr86o5V168gUhbKVQrvdtM65oDMaBNvDztTcfbw/formResponse 11/13
7/22/2021 Information and coding theory::PGIT 203:: Semester End Examination:: Academic Session:: 2020-21
The nonsystematic codeword for a linear cyclic code generated by the 2 পয়েন্ট
generator polynomial g(X) = 1+x+x^3, for the message bits m = 0101 is
_________________
1100111
0100111
0100101
0100011
এই সামগ্রীটি Google এর দ্বারা তৈরি বা অনুমোদিত হয়নি৷ আপত্তিজনক অভিযোগ করুন - পরিষেবার শর্তাদি - গোপনীয়তা
নীতি
র্ম লি
https://docs.google.com/forms/d/e/1FAIpQLSecn7xs9LIwr86o5V168gUhbKVQrvdtM65oDMaBNvDztTcfbw/formResponse 12/13
7/22/2021 Information and coding theory::PGIT 203:: Semester End Examination:: Academic Session:: 2020-21
ফর্মগুলি
https://docs.google.com/forms/d/e/1FAIpQLSecn7xs9LIwr86o5V168gUhbKVQrvdtM65oDMaBNvDztTcfbw/formResponse 13/13