Unit#5 (Part1) Coding Theory
Unit#5 (Part1) Coding Theory
Es/Encoded
D Decoded
Message Chan a >
Received &
Message Massage
in
Th to be is
ent inter
encode using
·
message
an
and
encoding -
is done
by a
, function)
function called ecoding
word channel
& When the coded passes through the cross
, may occur .
The
decoder corrects the Grow in the distated message and decode the
corrected version using decoding
rule into the original message .
(The
process
is called decoding and is done using a function , called decoding
function
geo
A finite sequence of characters from a finite alphabet is called
message.
e is "HELLO" is a
message from english alphabet .
Word :
=
-
of symbols
Seuence from an
alphabet is called a
Ford
Code :
-
code is a collection of words that are to be und to represent
messages .
is which
-A
block code a code consists of words of
same
length .
Leg
.
000 101 11
Remark
=
& We assume that the alphabet is the binary alphabet 20117 ·
g .
B3 =
2000 ,
001
,
010 ,
011
, 100 , 101 ,
110
, 1117
Def ! - A I , ms code for a
binary message is IBM BY , ,
E , D)
B" -
set of all binary me tuples
BY >
- Set of all binary i tuples where >m
E Bm in is
: -
encoding function
D: RED") >
- Bh is decoding function.
#nor-detecting code : -
& -
(Imm ,
m) -
Elana2---am) =
[Link] Aman
if
Go
where ama even number of tis in 9, 92---am
L it odd number is
of in aaz- . am .
Write (4 , 3)
parity check code
E : B - BY
E1000s =
0000 El100) =
1006
Eloo1) =
0011 Ello1 =
1010
=
010 Ell10) =
1100
C encoding functi EB
!
(smm) Triple Repetition code)
-
The
El @a2 .
--
am) =
GA---am A 92
,
- -
Aml An ---
Am
e .
.
g if m =3
E10007 =
000000000 El100) = 100100100
El010) =
010010010 Ell10) = 110110110
with two
C if 100100000 is received as 10/10/100 ↓ essa
furthermore decode b
we by examining
can ,
the first , fourth
I seventh
positions to see which digit appears more times . Here I occurs all three
times so the first entry in the decoded message is .
L
Ultimately if we divide
two
b in
block will
three equal block there was
be same and then take one block
& If
only one essor then
from that and that will be the decoded
message b.
#Humming
weight weight is the function W : Al =
B") >
-
2012 ... In
& W10000 = 0
WHOOD = 2
,
WIllll) =
4
,
.
Hamming distance
:
function d : B"XB"
-
Hamming distance is the >
- Go 2--n) ,
& d1011 ,
011) = 0
,
d1011 ,
000 =
1
d/1110000 ,
0001111) =
7 .
#etised
:
Let v, 2 , 2 Bh the
,
Is &14 , 4) = dians
(ii) d (4 , 2) >, 0
(v) dista ,
Ita) =
dix,y) (word ut a means word followed
-
- by a)
(v) d(x , 2) = winty) .2
2 .
Olo + 11 = 01011
The minimum
distance function Br-h is
of an
encoding E !
mindd(Eins , Elz1) /U
&
, 2 -
EIU) #Ely)
Bm
&
it minimum of the distances
blu all distinct pairs of
code words .
e . Let E: B -B
El00) =
000 =
2 ElO1) =
101 = Us
E(10) =
Oll =aL E111) =
010 = Mr
dix in2)
, = 2 dIx , 4) =
2
dick Ms) ,
= 2 d /U2 , (n) =
L
dlu 2) ,
=
1 didy (n),
=
3
I: -
A code IBM B" E D) can
,
detect at most R errors it and
, ,
is
only if the minimum distance blu any two distinct code words
R+
under
component wise addition (mod 2)
& Bm is closed I becom of mod 2)
· addition is in
Associativity hold becos associative each
component
& zero word 00--o is the identity element
⑨ Each element is the self inverse.
& u+
y y+ BR.
=
+ u, 3t
& B =
500 10 01
116 is a
group addition
under
componentwise
, , ,
mod 2.
+ 00 10 01 11
00 00 10 01 11 E = 00
Do 10 0011 0 10 : 10
or =
0
01 01 L 00 10 IT' = 11
11 11 0 10 00
Leth) -
Let E ! BM - &" be an
coding function .
The C it
Rangeo
ElBM)
is
code =
is called a code
up is 6 .
-
Q :- Show that
=
15, 2)
encoding function 2 : B-B defined by
I
then YIUtElBY) with UER & dlu ,
v) =
.
d
Now let1 be a nonzero code word S A
.
.
Will ways nonzero codewordy.
: dedim 0 ,
= was
cluivs
Again d= =
W/ +) <, will
Here d =
wis) ·
000 G
O I I
= 0 10 + 00L
11 0
IB , Bu
E : B2-B3