EEL -862

ASSIGNMENT - 1
ASHISH KUMAR
2012EE50544
ANS -1. A) crossword length = 3
Dimension = 2
Rate = dimension/(crossword length) = 2/3.
B) if C and C belongs to code X with field F (0,1) then
aC + bC = C should belong to X where a,b belongs to F.
000+011 = 011
011+101= 110
110+101= 011
110+011=101
Here we can see that all the values belong to the code X for all
combinations of a,b ,C ,C.
So, This code is a linear code.

Minimum distance of the linear code is d(c).

d(c) = min{d(C,C) ,C not equal C)
= min{d(C-C, 0) ,C not equal C)
=2
No. of error that can be detected is the floor( dmin-1)/2
= floor [(2-1)/2]
= 0.

C) as we can see that 001 , 010 ,111 , 100 are of length 3 equidistant
from the 2 of the given code words
So it would not be considered in any of them.
P0 = * ( 1- (1-e)3)
We would use similar approach for other parts also,

Taking P0 same for all.

Perror = 4* P0 = 4 * * ( 1- (1-e)3)

D) 000 ,111
rate of code= D/2 = log 2 2 = 1/3 .
ML detector can detect 000 for the output 000 , 001 , 010 ,100
So
Pe0 = 1- Pcorrect
= 1- (1-e)3 3* e (1-e)2
Pee = *Pe0 + * Pe1
is the probability of sending 000.
Pe0 = Pe1
Pee = 1- (1-e)3 3*e(1-e)2
= e3 +3(1-e)*e2
Error Probability = 1- (1-e)3 3*e(1-e)2 Vs e

Error Probability = err(l) = 1-(1-a(l))^3 - a(l)*(1-a(l))^2

ANS 2.
Systematic generator matrix is used to relate the information bits and the code
bits.
i.e. XIf=C where If is the information vector matrix, X is the systematic
generator matrix and C is the coded bit matrix.
For a linear code the systematic generator matrix [I |P]
I : identity matrix ,P: parity matrix.
Generator matrix has the dimension as k X n where k=log 2M where I is k X k
and P is k X (n-k).
So, the hamming weight of the code-words will be maximum possible number
on ones in any row of X = Number of ones in I + Number of ones in P = 1+n-k
= n-log 2M+1.
Hence, d<= n-log 2M+1 this statement is not true for non-linear code as we
know that the X does not have this form for non-linear code.

ANS 3.
In minimum distance decoding,
If k is the maximum no. of errors made during transmission
K= floor(1/2 *(d-1)) d is hamming distance.
Then we can decode it correctly during decoding process.
Substituting values of d and n
1

M *
=0

(7) <= 27

M <= 27/23
M <= 24
Maximum value of M = 16.
Code rate Vs n