Assignments - NOC - Introduction To Coding Theory

Introduction to Coding Theory - - Unit 1 - How t... https://onlinecourses.nptel.ac.in/noc19_ee26/un...
[email protected] ▼
Courses » Introduction to Coding Theory
Announcements Course Ask a Question Progress FAQ
Unit 1 - How to
access the portal
Register for
Certification exam Assignment 0
The due date for submitting this assignment has passed.
Course As per our records you have not submitted this Due on 2019-01-28, 23:59 IST.
outline
assignment.
How to access 1) If A and B are two mutually exclusive and exhaustive events then which of the following is 1 point
the portal correct?
How to access
the home page
P (A ∩ B) = 0
How to access
the course
page P (A ∪ B) = 1
How to access Both (a) and (b)
the MCQ, MSQ
None of the above
and
Programming
No, the answer is incorrect.
assignments
Score: 0
How to access
Accepted Answers:
the subjective
Both (a) and (b)
assignments
Quiz : 2) If A and B are two independent events then which of the following is correct? 1 point
Assignment 0
Week 1 P (A|B) = P (A)
Week 2
P (B|A) = P (B)
Week 3
P (A ∩ B) = P (A)P (B)
Week 4
All of the above
Week 5 No, the answer is incorrect.
Score: 0
Week 6
Accepted Answers:
Week 7 All of the above
© 2014 NPTEL - Privacy & Terms - Honor Code - FAQs -

A project of In association with
Funded by
1 of 4 Friday 10 May 2019 10:26 AM

P (A) ≥ P (B) by
Powered
P (A) = P (B)
None of the above

Score: 0
Accepted Answers:
P (B) ≥ P (A)
4) If A = A1 ∪ A2 ⋯ ∪ An where A1 , A2 ⋯ An are mutually exclusive events 1 point
then P (A) = ∑ni=1 P (Ai )?
True
False

Score: 0
Accepted Answers:
True
5) Let X be a Gaussian distributed random variable with probability density function given by 1 point
x2
∞
fX (x) = 1
√2π
e− 2 then what is the value of ∫0 fX (x)dx?
1
2
1
√2π
1
√2

Score: 0
Accepted Answers:
1
2
6) Let A and B two independent events with P (A) = p1 and P (B) = p2. Find P (Bc |A). 1 point
1 − p1
1−p1
1+p2
1−p2
p1
1 − p2
Score: 0
Accepted Answers:
1 − p2
7) Let an exponential probability density function is given 1 point
2 of 4 Friday 10 May 2019 10:26 AM

e−λx for x ≥ 0
={
λ
by fX (x) m
0 otherwise
∞ 1
Where λ is a constant parameter. Now if ∫−∞ xfX (x)dx = 2λ
, then find out the value of m which
satisfies the above equation.
1
2
1
4

Score: 0
Accepted Answers:
2
8) A bag contains 6 white and 4 black balls. 2 balls are drawn at random. Find the probability 1 point
that they are of same colour.
1
2
7
15
8
15
1
9

Score: 0
Accepted Answers:
7
15
9) If the probability of hitting a target is 3 . Then what is the probability of the target being hit 6 1 point
4
times out of 10 attempts?
0.3164
0.146
0.0162
0.1779

Score: 0
Accepted Answers:
0.146
10)If a dice is rolled and a unbiased coin is tossed, then what is the probability of getting a 1 point
head from the coin and an even number from the dice at the same time?
0.33
0.67
3 of 4 Friday 10 May 2019 10:26 AM

0.25
0.16

Score: 0
Accepted Answers:
0.25
Previous Page End
4 of 4 Friday 10 May 2019 10:26 AM

Introduction to Coding Theory - - Unit 2 - Week 1 https://onlinecourses.nptel.ac.in/noc19_ee26/un...
Unit 2 - Week 1
Register for
outline
assignment.
How to access 1) Channel coding involves 1 point

the portal
Adding parity bits
Week 1
Modulating analog signal using digital information
Introduction to
Removing redundancy from the information sequence
Error Control
Coding-I Making communication secure
Introduction to No, the answer is incorrect.

Error Control Score: 0
Coding-II
Accepted Answers:
Introduction to Adding parity bits
Error Control
1
Coding-III 2) If we encode the following information sequence using R = 2
repetition code, what will be1 point
Introduction to the coded sequence?
Linear Block Information sequence: 1011
Codes,
Generator
11110011
Matrix and
Parity Check 11001111
Matrix
10111011
Syndrome,
Error None of the above
Correction and
Error Detection
Score: 0
Problem
Solving
Accepted Answers:
Session-I 11001111
Quiz : 3) Given below is a generator matrix for (4,3) linear block code: 1 point
Assignment 1
⎡1 0 1 0⎤
G = ⎢1 1 1 1⎥
⎣1 1⎦
An Introduction
To Coding 1 0
Theory - Week
List the set of codewords.
1 Feedback
Assignment-1 {0000, 1100, 1111, 0011, 1010, 0110, 0101, 1000}
A project of
solution In association with
{0000, 1101, 1111, 0011, 1010, 0110, 1101, 1001}
Week 2 {0000, 1101, 1111, 0011, 1010, 0110, 0101, 1011}
Funded
{0000, 1101, 1111, 0010, 1010, by 0101, 1000}
0111,
Week 3
1 of 4 Friday 10 May 2019 10:27 AM


Powered by
Week 4
Score: 0
Week 5 Accepted Answers:

{0000, 1101, 1111, 0010, 1010, 0111, 0101, 1000}
Week 6 1
4) An information bit is encoded using R = 2
repetition code. Two errors occur during the 1 point
Week 7 transmission of coded bits through a binary symmetric channel. Which of the following statement is
correct?
Week 8
Two errors can be detected.
Two errors can be corrected.
Two errors can be undetected.
None of the above

Score: 0
Accepted Answers:
Two errors can be undetected.
5) What should be the rank of the parity check matrix for (15,11) linear block code? 1 point
15
11

Score: 0
Accepted Answers:
4
6) Given below a parity check matrix of a linear block code: 1 point

⎡1 1 1 1 1 1 1⎤
⎢1 1⎥
⎢ ⎥
1 0 1 1 0
H=⎢
⎢0 1⎥
⎥
⎢ ⎥
0 0 0 0 0
⎢0 1 0 0 0 0 0⎥
⎣0 1 1 0 0 1 1⎦
This corresponds to a
(7,2) linear block code

Score: 0
Accepted Answers:
7) In a (7,4) linear block code, if received codeword is r = (1110101) and generator matrix 1 point
(in systematic form) is
⎡1 1 0 1 0 0 0⎤
⎢1 0⎥
G=⎢ ⎥
1 1 0 1 0
⎢0 1 1 0 0 1 0⎥
⎣1 1 0 0 0 0 1⎦
Then, the syndrome will be
2 of 4 Friday 10 May 2019 10:27 AM

(0 0 0)
(1 0 1)
(1 1 1)
(1 1 0)

Score: 0
Accepted Answers:
(1 1 0)
8) What is the Hamming distance between the codewords ``1101011'' and ``1001101''? 1 point

Score: 0
Accepted Answers:
3
9) In a communication system, error correction is achieved by 1 point
Channel coding
Encryption
Modulation
Source coding

Score: 0
Accepted Answers:
Channel coding
10)An information source emits 1 and 0 with probability 0.3 and 0.7 respectively, and the bit is 1 point
transmitted through a binary symmetric channel (BSC) shown below. What is the probability of received
sequence ``10''?
0.4356
0.2244
0.21
0.1156

Score: 0
Accepted Answers:
0.2244
3 of 4 Friday 10 May 2019 10:27 AM

Previous Page End
4 of 4 Friday 10 May 2019 10:27 AM

Unit 3 - Week 2
Register for
outline
assignment.
How to access 1) A (6,3) linear block code is specified by the parity matrix H as given below (use the 1 point
the portal same H matrix for all questions, Q-1 to Q-10.)
⎡1 0 0 0 1 1⎤
Week 1
H = ⎢0 1 0 1 0 1⎥
⎣0 0 1 1 1 0⎦
Week 2
What is the minimum distance of the code?
Decoding of
Linear Block 1
Codes
2
Distance
Properties of 3
Linear Block
4
Codes-I
Distance
Properties of Score: 0
Linear Block Accepted Answers:
Codes-II
3
Problem
Solving 2) What is the maximum number of erasures this code can correct? 1 point
Session-II
1
Quiz :
Assignment 2 2
An Introduction 3
To Coding
4
Theory - Week
2 Feedback
Assignment-2 Score: 0
solution
Accepted Answers:
2
Week 3
3) What is the maximum number of errors this code can detect? 1 point
Week 4

Funded by
1 of 4 Friday 10 May 2019 10:27 AM

Score: 0 Powered by
Week 8
Accepted Answers:
2
4) What is the maximum number of errors this code can correct? 1 point

Score: 0
Accepted Answers:
1
5) Given below two statement about the error correcting and error detecting capability of the 1 point
code :
S1 : Code can simultaneously correct and detect single error.
S2 : Code can simultaneously correct 1 error and 1 erasure.
Then which of the following option is correct?
Only S1 is true.
Only S2 is true.
Both S1 and S2 are true.
None of the above.

Score: 0
Accepted Answers:
Only S1 is true.
6) Syndrome corresponding to received sequence 101000 is 1 point
001
010
100
101

Score: 0
Accepted Answers:
101
7) Error pattern 010000 and 111000 belongs to same coset? 1 point
true
false

Score: 0
Accepted Answers:
false
8) The generator matrix G in systematic form is 1 point
2 of 4 Friday 10 May 2019 10:27 AM

⎡0 1 1 1 0 0⎤
G = ⎢1 0 1 0 1 0⎥
⎣1 1 0 0 0 1⎦
⎡1 1 0 1 0 0⎤
G = ⎢1 0 1 0 1 0⎥
⎣0 1 1 0 0 1⎦
⎡1 0 0 0 1 1⎤
G = ⎢0 1 0 1 0 1⎥
⎣0 0 1 1 1 0⎦
None of the above

Score: 0
Accepted Answers:
⎡0 1 1 1 0 0⎤
G = ⎢1 0 1 0 1 0⎥
⎣1 1 0 0 0 1⎦
9) If Ai denotes number of codewords with Hamming weight i , then 1 point
Find A0 , A1 , A2 , A3 , A4 , A5 and A6 ?
A0 = 0, A1 = 0, A2 = 0, A3 = 3, A4 = 4, A5 = 1, A6 = 0
A0 = 1, A1 = 0, A2 = 0, A3 = 3, A4 = 4, A5 = 0, A6 = 0
A0 = 1, A1 = 0, A2 = 0, A3 = 4, A4 = 3, A5 = 0, A6 = 0
None of the above.

Score: 0
Accepted Answers:
A0 = 1, A1 = 0, A2 = 0, A3 = 4, A4 = 3, A5 = 0, A6 = 0
10)The codewords are sent over a binary symmetric channel (BSC) with crossover 1 point
probability p = 0.3 . Undetected error probability is given by
0.019
0.029
0.039
0.049

Score: 0
Accepted Answers:
0.049
Previous Page End
3 of 4 Friday 10 May 2019 10:27 AM

4 of 4 Friday 10 May 2019 10:27 AM

Unit 4 - Week 3
Register for
outline
assignment.
How to access 1) Let C1 , C2 be two linear block codes defined by generator 1 point
the portal
⎡1 0 0 1 1 0⎤
matrices G1 = ⎢ 0 1 0 1 0 1 ⎥ and G2
⎣0 1⎦
respectively. If C1 be dual code of C2 , which of
Week 1
0 1 1 1
Week 2 the following could be the generator matrix G2 ?
⎡1 0⎤
Week 3
1 0 0 1
⎢0 1 0 1 0 1⎥
⎣0 1⎦
Some Simple
Linear Block
Codes-I 0 1 0 1
⎡1 0⎤
Some Simple
1 0 0 1
⎢0 1⎥
Linear Block
1 0 1 0
⎣1 1⎦
Codes-II: Reed
Muller Codes
0 0 1 1
Bounds on the
⎡1 0⎤
Size of a Code
1 0 1 1
⎢0 1⎥
Problem
1 0 1 0
⎣0 1⎦
Solving
Session-III 0 1 0 1
Quiz :
⎡1 1 1 1 0 0⎤
Assignment 3
⎢1 0 1 0 1 0⎥
⎣0 1⎦
Assignment-3
solution 1 1 0 0
An Introduction
To Coding
Theory - Week Score: 0
3 Feedback Accepted Answers:
⎡1 1 1 1 0 0⎤
⎢1 0⎥
Week 4
0 1 0 1
⎣0 1 1 0 0 1⎦
Week 5

Funded by
1 of 4 Friday 10 May 2019 10:28 AM

Powered by
Fifth bit
Seventh bit

Score: 0
Accepted Answers:
Third bit
3) A RM(1,4) code can simultaneously correct two errors and two erasures? 1 point
True
False

Score: 0
Accepted Answers:
True
4) An information sequence is encoded using (7,6) Single Parity Check (SPC) code and sent 1 point
over a binary symmetric channel. Received sequence is 1100011. Which of the following statement is
true?
(a) No error occured
(b) Even number of errors occurred
(c) Odd number of errors occurred
(d) Either of (a) and (b)

Score: 0
Accepted Answers:
(d) Either of (a) and (b)
5) Generator matrix of Reed Muller RM(1,3) code is given by 1 point
⎡1 0 0 0 0 1 0 1⎤
⎢0 1⎥
⎢ ⎥
1 0 0 0 0 1
⎢0 0 1 0 1 1 0 0⎥
⎣0 0 0 1 1 1 1 1⎦
⎡1 1 1 1 1 1 1 1⎤
⎢0 1⎥
⎢ ⎥
1 0 1 0 1 0
⎢0 0 1 1 0 0 1 1⎥
⎣0 0 0 0 1 1 1 1⎦
⎡1 1 1 1 1 1 1 1⎤
⎢0 1⎥
⎢ ⎥
1 0 1 0 1 0
⎢0 1⎥
⎢ 0 1 1 0 0 1 ⎥
⎢ ⎥
⎢0 1⎥
⎢ ⎥
0 0 0 1 1 1
⎢0 1⎥
⎢ ⎥
⎢ ⎥
0 0 1 0 0 0
⎢0 0 0 0 0 0 1 1⎥
⎣0 0 0 0 0 1 0 1⎦
None of them

Score: 0
2 of 4 Friday 10 May 2019 10:28 AM

Accepted Answers:
⎡1 1 1 1 1 1 1 1⎤
⎢0 1⎥
⎢ ⎥
1 0 1 0 1 0
⎢0 0 1 1 0 0 1 1⎥
⎣0 0 0 0 1 1 1 1⎦
6) Which of the following is an example of perfect code? 1 point
(7,3,3)
(8,4,4)
(7,3,4)
None of them

Score: 0
Accepted Answers:
None of them
7) Which of the following as an example 1 point

of maximum distance separable (MDS) code?
Repetition code
Single error correcting Hamming code
Reed Muller code
None of the them

Score: 0
Accepted Answers:
Repetition code
8) Which of the following is a valid binary linear block code? 1 point
(7,5,3)
(7,4,4)
(7,4,3)
None of them

Score: 0
Accepted Answers:
(7,4,3)
9) Which of the code parameters are not correct? 1 point
(31, 26) Hamming code
(30, 25) Shortened Hamming code
(31, 25) Expurgated Hamming code
(32, 27) Extended Hamming code

Score: 0
Accepted Answers:
(32, 27) Extended Hamming code
10)A code derived from (15,11) Hamming code is described by following parity check 1 point
matrix H . This is an example of
3 of 4 Friday 10 May 2019 10:28 AM

⎡1 1 0 1 0 1 0 1 1 0 1 0 1⎤
⎢0 1⎥
H=⎢ ⎥
1 0 0 1 1 0 0 1 0 0 1
⎢0 0 1 1 1 1 0 0 0 1 1 1 1⎥
⎣0 0 0 0 0 0 1 1 1 1 1 1 1⎦
Extended Hamming code
Expurgated Hamming code
Shortened Hamming code
None of the them

Score: 0
Accepted Answers:
Shortened Hamming code
Previous Page End
4 of 4 Friday 10 May 2019 10:28 AM

Unit 5 - Week 4
Register for
outline
assignment.
How to access 1) Consider a non-systematic feed-forward convolution encoder whose block diagram is given 1 point
the portal below (use the same block diagram for all questions, Q-1 to Q-10.)
Week 1
Week 2
Week 3
Week 4
Introduction to
Convolutional
Codes-I:
Encoding Convolution encoder parameter (n,k,m) for the code is ?
Introduction to
Convolutional (1,2,3)
Codes-II: State
(3,2,1)
Diagram, Trellis
Diagram (3,1,2)
Convolutional (2,1,3)
Codes:
Classification, No, the answer is incorrect.
Realization Score: 0
Convolutional Accepted Answers:
Codes:Distance (3,1,2)
Properties
2) The generator sequence for the code is ? 1 point
Decoding of
Convolutional
Codes-I: Viterbi
Algorithm g(1) = (110), g(2) = (101), g(3) = (111)
Quiz :
Assignment 4 g(1) = (111), g(2) = (101), g(3) = (110)
An Introduction
g = (110), g = (001), g
© 2014
(1) NPTEL - Privacy
(2) & Terms - Honor
(3) Code - FAQs -
To Coding
= (111)
Theory
A project of - Week In association with
4 Feedback
Assignment-4 g(1) = (111), g(2) = (001), g(3) = (110)

solution
No, the answer is incorrect. Funded by
Score: 0
1 of 6 Friday 10 May 2019 10:28 AM

Accepted Answers:
Powered by
Week 5
g(1) = (110), g(2) = (101), g(3) = (111)
Week 6 3) Time domain generator matrix G of the code is ? 1 point
Week 7
⎡ 111 001 110 ⎤

⎢
⎢ ⎥
⎥
Week 8
111 001 110
⎢
⎢ ⎥
⎥
⎢ ⎥
111 001 110
⎣ ⋱ ⋱ ⋱ ⋱⎦
⎡ 111 101 110 ⎤

⎢
⎢
111 101 110 ⎥
⎥
⎢
⎢ ⎥
⎥
⎢ ⎥
111 101 110
⎣ ⋱ ⋱ ⋱ ⋱⎦
⎡ 110 101 111 ⎤

⎢
⎢
110 101 111 ⎥
⎥
⎢
⎢ ⎥
⎥
⎢ ⎥
110 101 111
⎣ ⋱ ⋱ ⋱ ⋱⎦
⎡ 111 101 011 ⎤

⎢
⎢
111 101 011 ⎥
⎥
⎢
⎢ ⎥
⎥
⎢ ⎥
111 101 011
⎣ ⋱ ⋱ ⋱ ⋱⎦
Score: 0
Accepted Answers:
⎡ 111 101 011 ⎤
⎢
⎢
111 101 011 ⎥
⎥
⎢
⎢ ⎥
⎥
⎢ ⎥
111 101 011
⎣ ⋱ ⋱ ⋱ ⋱⎦
4) Codeword sequence corresponding to the information sequence u = (11011) is ? 1 point
(Initially the encoder is in all-zero state)
(111, 010, 011, 011, 011)
(111, 010, 110, 100, 010)
(111, 010, 110, 011, 110)
(111, 111, 000, 111, 111)

Score: 0
Accepted Answers:
(111, 010, 110, 100, 010)
5) State diagram of the code is ? 1 point
2 of 6 Friday 10 May 2019 10:28 AM

3 of 6 Friday 10 May 2019 10:28 AM


Score: 0
Accepted Answers:
6) Weight enumerating function of the code is ? 1 point
X9
1−2X−X 2
X8
1−2X−X 2 +X 4
X5
1−2X
X7
1−X−X 3

Score: 0
Accepted Answers:
X7
1−X−X 3
7) Free distance of the code is ? 1 point
4 of 6 Friday 10 May 2019 10:28 AM

10

Score: 0
Accepted Answers:
7
8) Is the encoder catastrophic? 1 point
Yes
No
can't say
sometimes

Score: 0
Accepted Answers:
No
9) If the given convolution code is changed to equivalent systematic convolution code then the 1 point
generator matrix G in transform domain for the new code is ?
[1 D2
1+D
1+D+D2
1+D
]
[1 ]
D2 1+D
1+D+D2 1+D+D2
[1 1+D 1+D+D2
1+D
]
[1 1+D 1 + D + D2 ]
Score: 0
Accepted Answers:
[1 1+D 1+D+D2
1+D
]
10)If the received coded bits are r=(110,110,110,111,010,101,101) then the decoded output 1 point
sequence of viterbi algorithm is ? (assume that the convolutional code is terminated at the zero state)
(111,010,111,011,111,101,011)
(101,010,110,011,111,101,011)
(111,010,110,011,101,111,011)
(111,010,110,011,111,101,011)

Score: 0
Accepted Answers:
(111,010,110,011,111,101,011)
Previous Page End
5 of 6 Friday 10 May 2019 10:28 AM

6 of 6 Friday 10 May 2019 10:28 AM

Unit 6 - Week 5
Register for
Certification exam Assignment-5
outline
assignment.
How to access 1) BCJR algorithm can be applied to 1 point

the portal
Linear block codes
Week 1
Convolutional codes
Week 2 both
none
Week 3
Week 4 Score: 0
Accepted Answers:
Week 5
both
Decoding of
2) What is the overall constraint length of the 1 point
Convolutional
D2 1
encoder G(D) = [ ] realized in controller canonical form ?
Codes-II: BCJR D
Algorithm 1 D2 1 + D + D2
Problem
solving 2
session-IV
4
Problem
6
solving
session-V 8
Performance No, the answer is incorrect.

Bounds for
Score: 0
Convolutional
Codes Accepted Answers:
4
Quiz :
Assignment-5 3) What is the overall constraint length of the 1 point
D2 1
encoder G(D) = [ ] realized in observer canonical form ?
An Introduction D
To Coding 1 D2 1 + D + D2
Theory - Week
5 Feedback
2
Assignment-5
© 20144NPTEL - Privacy & Terms - Honor Code - FAQs -
solution
A project of 6 In association with
Week 6
8
Funded by
Score: 0
1 of 4 Friday 10 May 2019 10:29 AM

Accepted Answers:
Powered by
Week 8
6
4) Is the encoder given by generator 1 point

matrix G(D) = [ 1 + D3 1+D2 +D3 +D5
] catastrophic?
1+D+D2
Yes
No

Score: 0
Accepted Answers:
Yes
5) Which of the following is the minimal encoder corresponding to the generator matrix? 1 point
G(D) = [ 1 1+D2 +D3 +D5
]
1+D+D2 +D3 +D4 +D5
[1 ]
1+D
1+D+D2
[1 1+D2
]
1+D+D2
[1 1+D2
]
1+D+D3
None of the above

Score: 0
Accepted Answers:
[1 1+D2
]
1+D+D2
6) Is the systematic equivalent encoder corresponding to the generator 1 point

1 1
matrix G(D) = [ ] realizable?
D
0 D2 1 + D2
Yes
No

Score: 0
Accepted Answers:
No
7) Consider the (2,1,2) non-systematic feedforward encoder 1 point

with G(D) = [1 + D2 1 + D + D2 ] . Its minimum delay feedforward inverse is given by
D2
[ ]
1 + D2
D2
[ ]
D2
1
[ ]
1
2 of 4 Friday 10 May 2019 10:29 AM

Does not exist

Score: 0
Accepted Answers:
1
[ ]
1
8) Consider the (3,1,2) non-systematic feed-forward encoder 1 point
with G(D) = [1 + D 1+D 2
1+D+ D2 ] . An information sequence is encoded using
this convolutional encoder and transmitted over a binary symmetric channel with crossover probability
of p = 10−2 . The event error probability can be approximated by
1.28 × 10−5
2 × 10−6
4 × 10−7
2.56 × 10−8
Score: 0
Accepted Answers:
1.28 × 10−5
9) Given below is a trellis diagram of (3,1,2) convolutional encoder. What is the correct 1 point
expression for forward recursion, alpha calculation? All the notations are same as used in the lectures.
αl (01) = γl−1 (00, 10) ∗ αl−1 (10) + γl−1 (11, 01) ∗ αl−1 (01)
αl (01) = γl−1 (10, 01) ∗ αl−1 (10) + γl−1 (11, 01) ∗ αl−1 (11)
αl (01) = γl−1 (01, 10) ∗ αl−1 (10) + γl−1 (01, 00) ∗ αl−1 (00)
3 of 4 Friday 10 May 2019 10:29 AM

none of the above

Score: 0
Accepted Answers:
αl (01) = γl−1 (10, 01) ∗ αl−1 (10) + γl−1 (11, 01) ∗ αl−1 (11)
10)For the same encoder given in previous question, what is the correct expression for beta 1 point
calculation? All the notations are same as used in the lectures.
βl (01) = γl (01, 10) ∗ βl+1 (10) + γl (01, 00) ∗ βl+1 (00)
βl (01) = γl (10, 01) ∗ βl+1 (01) + γl (10, 00) ∗ βl+1 (00)
βl (01) = γl (10, 01) ∗ βl+1 (10) + γl (11, 01) ∗ βl+1 (11)

none of the above

Score: 0
Accepted Answers:
βl (01) = γl (01, 10) ∗ βl+1 (10) + γl (01, 00) ∗ βl+1 (00)
Previous Page End
4 of 4 Friday 10 May 2019 10:29 AM

Unit 7 - Week 6
Register for
outline
assignment.
How to access 1) Consider a LDPC code whose Tanner graph is given below (use the same Tanner graph for 1 point
the portal Q-1 to Q-7.)
Week 1
Week 2
Week 3
Week 4
Week 5
What is the parity check matrix for this code?
Week 6
⎡1 1 1 1 1 0 0 0 0 0 0 1 0 0 0⎤
Low Density
⎢0 0⎥
⎢ ⎥
Parity Check
0 0 0 0 1 1 1 1 1 0 0 0 0
⎢0 1⎥
Codes
H=⎢ ⎥
0 0 0 0 0 0 0 0 0 1 1 1 1
⎢0 1⎥
⎢ ⎥
Decoding of
⎢ ⎥
1 1 0 1 0 1 0 0 0 0 0 0 0
⎢1 0⎥
Low Density
0 0 0 0 0 0 1 0 1 1 0 1 0
⎣1 0⎦
Parity Check
Codes-I
0 0 1 0 1 0 0 1 0 0 1 0 1
Decoding of
⎡1 0⎤
Low Density
Parity Check 1 0 1 1 0 0 1 0 0 0 0 0 0
⎢0 0⎥
⎢ ⎥
Codes-II: Belief 0 0 0 0 1 1 1 1 1 0 0 0 0
⎢0 1⎥
H=⎢ ⎥
Propagation
1 0 0 0 0 0 0 0 0 0 1 1 1
⎢0 1⎥
⎢ ⎥
Algorithm
⎢ ⎥
1 1 0 1 0 1 0 0 0 0 0 0 0
⎢1 0⎥
Quiz :
0 0 0 0 0 0 1 0 1 1 0 1 0
⎣0 0⎦
Assignment-6
An Introduction
0 0 1 0 1 0 0 1 0 0 1 0 1
To Coding
⎡1 1 1 1 1 0 0 0 0 0 0 0 0 0 0⎤
Theory - Week
⎢0 0 0 0 0 1 1 1 1 1 0 0⎥
6 Feedback
⎢ ⎥
0 0 0
⎢ 0 0- Privacy 1⎥
H=⎢ ⎥
Assignment-6 © 2014 NPTEL & Terms - Honor Code - FAQs -
0 0 0 0 0 0 0 0 1 1 1 1
⎢ 0 1 1 0 1 0In association 1⎥
⎢ ⎥
solution
⎢ ⎥
A project of with
1 0 0 0 0 0 0 0
Week 7 ⎢1 0 0 0 0 0 0 1 0 1 1 0 1 0 0⎥
⎣0 0 0 1 0 1 0 0 1 0 0 1 0 1 0⎦
Week 8 Funded by
None of the above
1 of 5 Friday 10 May 2019 10:29 AM


Powered by
Score: 0
Accepted Answers:
⎡1 1 1 1 1 0 0 0 0 0 0 0 0 0 0⎤
⎢0 0⎥
⎢ ⎥
0 0 0 0 1 1 1 1 1 0 0 0 0
⎢0 1⎥
H=⎢ ⎥
0 0 0 0 0 0 0 0 0 1 1 1 1
⎢0 1⎥
⎢ ⎥
⎢ ⎥
1 1 0 1 0 1 0 0 0 0 0 0 0
⎢1 0 0 0 0 0 0 1 0 1 1 0 1 0 0⎥
⎣0 0 0 1 0 1 0 0 1 0 0 1 0 1 0⎦
2) The code is an example of regular LDPC code? 1 point
true
false

Score: 0
Accepted Answers:
true
3) LDPC code parameter (n, wc , wr ) for the code is ? 1 point
(15, 2, 6)
(15, 2, 5)
(6, 2, 6)
(6, 2, 5)

Score: 0
Accepted Answers:
(15, 2, 5)
4) Code rate R is given by? 1 point
2
5
3
5
2
3
None of the above

Score: 0
Accepted Answers:
2
3
5) Column degree distribution of the Tanner graph is? 1 point
x2
x3
2 of 5 Friday 10 May 2019 10:29 AM

x6
Score: 0
Accepted Answers:
x
6) Row degree distribution of the Tanner graph is? 1 point
x2
x4
x5
x15
Score: 0
Accepted Answers:
x4
7) What is the girth of the Tanner graph? 1 point
10

Score: 0
Accepted Answers:
4
8) Given the generator matrix G of a systematic code, what is the corresponding Tanner 1 point
graph of this code?
⎡1 1 0 1 0 0⎤
G = ⎢1 0 1 0 1 0⎥
⎣1 1 1 0 0 1⎦
3 of 5 Friday 10 May 2019 10:29 AM

None of the above

Score: 0
Accepted Answers:
9) Using permutation matrices, which of the following construction can be used to generate 1 point
(6,3) regular LDPC code?
(Notations used are same as used in lecture slides.)
All of the above

Score: 0
Accepted Answers:
All of the above
10)What is the girth of the Tanner graph of a LDPC code whose parity check matrix H is given 1 point
by
⎡1 1 1 0 0 0 0 0 0 0⎤
⎢0 0⎥
⎢ ⎥
0 0 1 1 1 0 0 0
H=⎢
⎢0 0⎥
⎥
⎢ ⎥
0 0 0 0 0 1 1 1
⎢0 1 0 1 0 0 0 0 1 0⎥
⎣0 0 1 0 0 0 1 0 0 1⎦

Score: 0
4 of 5 Friday 10 May 2019 10:29 AM

Accepted Answers:
8
Previous Page End
5 of 5 Friday 10 May 2019 10:29 AM

Unit 8 - Week 7
Register for
outline
assignment.
How to access 1) Which of the following statements is incorrect? 1 point

the portal
Turbo codes are parallel concatenated convolutional codes.
Week 1
Turbo codes perform well in high signal to noise ratio(SNR) region due to error floor.
Week 2 Block codes also can be used as constituent codes in turbo encoders.
Turbo codes can achieve performance close to Shannon limit.

Week 3
Week 4 Score: 0
Accepted Answers:
Week 5
Turbo codes perform well in high signal to noise ratio(SNR) region due to error floor.
Week 6 2) Which of the following statements is incorrect for an interleaver ? 1 point
Week 7 Interleaver changes the weight of the input sequence.
Turbo Codes Pseudo-random interleavers are good.
Turbo Decoding State complexity of turbo codes is increased by interleaver.
Problem Interleaver affects the performance of turbo codes in error floor region.
Solving
Sessions-VI No, the answer is incorrect.
Score: 0
Quiz :
Assignment-7 Accepted Answers:
Interleaver changes the weight of the input sequence.
An Introduction
To Coding 3) max∗ (x + y, y + z) is equal to 1 point
Theory - Week
7 Feedback
Assignment-7 max∗ (x, 2y, z)

solution
Week 8 z + max∗ (x, y)

Funded by
1 of 4 Friday 10 May 2019 10:30 AM

Accepted Answers:
Powered by
y + log(ex + ez )
4) For a rate R=1/3 turbo code, what is the correct expression for computation of extrinsic 1 point
information at the output of decoder 2? All the notations are same as used in the lectures.
L(1) (ul )
L(2) (ul )
(0) (1)
L(2) (ul ) − Lc rl − Le (ul )
(0) (1)
L(2) (ul ) + Lc rl + Lc rl
Score: 0
Accepted Answers:
(0) (1)
L(2) (ul ) − Lc rl − Le (ul )
5) For reliable communication in band limited channel in the presence of Gaussian noise, 1 point
what is the minimum signal to noise ratio Eb /N0 required if we are using a rate R=1/3 code?
-0.5497 dB
-1.2658 dB
-1.0995 dB
-2.5317 dB

Score: 0
Accepted Answers:
-0.5497 dB
6) Given a rate R=1/3 turbo code,with rate R=1/2 convolutional encoder as constituent 1 point
encoder with G(D) = [1 1
1+D
]. For the block length of N= 6, an interleaving pattern given
by Π(i) = {2, 5, 0, 4, 3, 1} is used. What is the output of the interleaver corresponding to input
sequence {1,0,1,0,1,1}?
{1,1,0,1,0,1}
{0,0,1,1,1,1}
{1,1,1,1,0,0}
None of the above
2 of 4 Friday 10 May 2019 10:30 AM


Score: 0
Accepted Answers:
{1,1,1,1,0,0}
7) What is the output of the turbo encoder given in previous question. 1 point
(011,010,101,001,111,101)
(111,010,101,001,111,110)
(111,010,101,000,110,100)
None of the above

Score: 0
Accepted Answers:
(111,010,101,000,110,100)
8) For a (2,1,2) convolutional encoder, which of the following is feasible value for dfree 1 point

Score: 0
Accepted Answers:
5
9) For the rate R=1/3 turbo encoder given in question 6, an input sequence of 4-bits 1 point
{-1,+1,-1,+1} is encoded and transmitted over Gaussian channel, where binary bit 0 is mapped as {-1}
and binary bit 1 is mapped as {+1}. Received sequence r is {0.8,0.1,-1.8,1.0,-0.5,1.2,-1.8,1.1,0.1,1.6,-
1.6,-1.1}. Assume that channel SNR Es /N0 = 1/4 and the encoder was in the all zero state initially.
Calculate the value of α∗1 (S0 ) for the decoder 1 at the first iteration
-0.45
-0.34
0.45
0.78

Score: 0
Accepted Answers:
-0.45
10)Calculate the value of β3∗ (S0 ) for the question 9. 1 point
3.45
1.23
-0.76

Score: 0
Accepted Answers:
0
3 of 4 Friday 10 May 2019 10:30 AM

Previous Page End
4 of 4 Friday 10 May 2019 10:30 AM

Unit 9 - Week 8

Funded by
1 of 4 Friday 10 May 2019 10:30 AM

Powered by
Register for
outline
assignment.
How to access 1) IRWEF of a (6,5) parity check code (SPC) is given by 1 point
the portal
Week 1 1 + 5W Z + 10W 2 Z + 10W 3 Z + 5W 4 Z + W 5 Z
Week 2
1 + 10W Z + 5W 2 + 5W 3 Z + 10W 4 + W 5 Z
Week 3
1 + 5W Z + 10W 2 + 10W 3 Z + 5W 4 + W 5 Z
Week 4
None of the above
Score: 0
Week 6
Accepted Answers:
Week 7 1 + 5W Z + 10W 2 + 10W 3 Z + 5W 4 + W 5 Z
2) Consider PCBC with (6,5) parity check code (SPC) as constituent encoder and interleaver 1 point
Week 8
size N = k. The average CWEF for input weight 3, is given by
Distance
Properties of
Turbo Codes 10Z 2
Convergence of
Turbo Codes 5Z 2
Automatic
Repeat reQuest
10Z
(ARQ)
Schemes None of the above
Applications of No, the answer is incorrect.
Linear Codes
Score: 0
Quiz : Accepted Answers:
Assignment-8
10Z 2
An Introduction
3) Consider PCBC with (6,5) parity check code (SPC) as constituent encoder and interleaver 1 point
To Coding
Theory - Week size N = k. The average IRWEF is given by
8 Feedback
Assignment-8
solution
5W Z + 10W 2 + 10W 3 Z + 5W 4 + W 5 Z
5W Z 2 + 10W 2 + 10W 3 Z 2 + 5W 4 + W 5 Z 2
5W Z + 10W 2 + 5W 3 Z + 10W 4 + W 5 Z
None of the above

Score: 0
Accepted Answers:
5W Z 2 + 10W 2 + 10W 3 Z 2 + 5W 4 + W 5 Z 2
4) Which of the following statement regarding convergence of turbo codes is false? 1 point
Existence of "tunnel'' in EXIT chart implies convergence of turbo decoding
2 of 4 Friday 10 May 2019 10:30 AM

El-Gamal's approach for predicting decoding threshold for turbo codes is based on Gaussian
approximation of the output extrinsic information
Convergence analysis of turbo codes assumes large input block sizes
None of the above

Score: 0
Accepted Answers:
None of the above
5) The generator polynomial for a (10,6) code is g(x) = x4 + x + 1 . For the input 1 point
sequence 1 1 0 0 0 1, the parity bits c3 , c2 , c1 , c0 are given as
0001
1010
0101
1100

Score: 0
Accepted Answers:
1100
6) In the Go-Back-N ARQ protocol, if the transmitter uses a (16,12) code, window of length 1 point
10, and the probability of acceptance of frame at the receiver is 0.01. The efficiency of the protocol is
7.5 × 10−3
1.3 × 10−3
7.6 × 10−4
None of the above

Score: 0
Accepted Answers:
7.6 × 10−4
7) Which of the following statement about ARQ protocols is not correct? 1 point
SR-ARQ is the most efficient ARQ scheme.
SR-ARQ is the most reliable ARQ scheme.
Type-II HARQ is more complex than Type-I HARQ scheme
Undetected error probability of CRC codes depends on number of parity bits

Score: 0
Accepted Answers:
SR-ARQ is the most reliable ARQ scheme.
8) First 9 digits of an ISBN-10 number are 622650814. The 10th digit is 1 point
3 of 4 Friday 10 May 2019 10:30 AM


Score: 0
Accepted Answers:
0
9) Which of the following is a valid Bookland Bar code (ISBN-13) number? 1 point
9788291383436
9788181283436
9788191283436
None of the above

Score: 0
Accepted Answers:
9788181283436
10)First 12 digits of an EAN are 791318330009. The 13th digit is 1 point

Score: 0
Accepted Answers:
2
Previous Page End
4 of 4 Friday 10 May 2019 10:30 AM

Assignments - NOC - Introduction To Coding Theory

Uploaded by

Copyright:

Available Formats

Assignments - NOC - Introduction To Coding Theory

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Assignments - NOC - Introduction To Coding Theory

Uploaded by

Copyright:

Available Formats

Introduction to Coding Theory - - Unit 1 - How t... https://onlinecourses.nptel.ac.in/noc19_ee26/un...

Courses » Introduction to Coding Theory

Announcements Course Ask a Question Progress FAQ

Week 1 P (A|B) = P (A)

© 2014 NPTEL - Privacy & Terms - Honor Code - FAQs -

1 of 4 Friday 10 May 2019 10:26 AM

No, the answer is incorrect.

No, the answer is incorrect.

No, the answer is incorrect.

2 of 4 Friday 10 May 2019 10:26 AM

No, the answer is incorrect.

No, the answer is incorrect.

No, the answer is incorrect.

3 of 4 Friday 10 May 2019 10:26 AM

No, the answer is incorrect.

Previous Page End

4 of 4 Friday 10 May 2019 10:26 AM

Courses » Introduction to Coding Theory

Announcements Course Ask a Question Progress FAQ

How to access 1) Channel coding involves 1 point

Introduction to No, the answer is incorrect.

1 of 4 Friday 10 May 2019 10:27 AM

No, the answer is incorrect.

Week 5 Accepted Answers:

Two errors can be corrected.

Two errors can be undetected.

None of the above

No, the answer is incorrect.

No, the answer is incorrect.

6) Given below a parity check matrix of a linear block code: 1 point

(7,2) linear block code

(7,3) linear block code

(7,4) linear block code

(7,5) linear block code

No, the answer is incorrect.

2 of 4 Friday 10 May 2019 10:27 AM

No, the answer is incorrect.

No, the answer is incorrect.

9) In a communication system, error correction is achieved by 1 point

No, the answer is incorrect.

No, the answer is incorrect.

3 of 4 Friday 10 May 2019 10:27 AM

Previous Page End

4 of 4 Friday 10 May 2019 10:27 AM

Courses » Introduction to Coding Theory

Announcements Course Ask a Question Progress FAQ

© 2014 NPTEL - Privacy & Terms - Honor Code - FAQs -

1 of 4 Friday 10 May 2019 10:27 AM

No, the answer is incorrect.

Both S1 and S2 are true.

None of the above.

No, the answer is incorrect.

6) Syndrome corresponding to received sequence 101000 is 1 point

No, the answer is incorrect.

7) Error pattern 010000 and 111000 belongs to same coset? 1 point

No, the answer is incorrect.

8) The generator matrix G in systematic form is 1 point

2 of 4 Friday 10 May 2019 10:27 AM

No, the answer is incorrect.