CT 2
CT 2
CT 2
I
B.Tech.(ExTc)
Sub: Coding Theory
Sem-VIII
Course Instructor
Dr. D. P. Rathod
PhD(Technology)Electronics Engg.
Dept. of Electronics Engineering
[email protected]
Mob-9819003515
Error Correcting Codes
➢ Block diagram of modern digital communication
system
➢ Error correcting codes/coding theory/ Channel
coding
➢ Hamming code(n, k)/Cyclic code(n,k)
➢ Code rate and valid code set
➢ Properties of matrix
➢ Modern linear abstract Algebra-
➢ Groups
➢ Fields
➢ Vector spaces
Code rate and code word set
➢ Code rate r = k/n
➢ Group
➢ Fields
➢ Vector Spaces
14
Modern Linear Abstract Algebra
➢ Fields:
15
Modern Linear Abstract Algebra
➢ Fields
➢ For Example:
19
Modern Linear Abstract Algebra
➢ Vector Spaces Vn :
➢ Let S be a nonempty subset of a vector space V over a field
F then, S is a subspace of V if the following conditions are
satisfied;
➢ Consider the vector space of all 5 tuple over GF(2) the set
00000 , 00111 , 11010 , 11101
20
Modern Linear Abstract Algebra
➢ Vector Spaces Vn :
➢ Linear Combination of vectors
➢ Let 𝑣1 , 𝑣2 , ⋯ , 𝑣𝑘 be k vectors in vector space V over a field F, let
𝑎1 , 𝑎2 , ⋯ , 𝑎𝑘 be k scalars from F. The sum of product of scalar and
vector that is
𝑎1 𝑣1 + 𝑎2 𝑣2 + ⋯ + 𝑎𝑘 𝑣𝑘
➢ Scalar Product :
➢ The product of scalar c in F & a linear combination of 𝑣1 , 𝑣2 , ⋯ , 𝑣𝑘 .
𝑐 . 𝑎1 𝑣1 + 𝑎2 𝑣2 + ⋯ + 𝑎𝑘 𝑣𝑘 = 𝑐. 𝑎1 𝑣1 + 𝑐. 𝑎2 𝑣2 + ⋯ + 𝑐. 𝑎𝑘 𝑣𝑘
21
Modern Linear Abstract Algebra
➢ Vector Spaces Vn :
➢ Statement:
➢ Proof:
➢ Example:
➢ Consider the vector space of all 5-tuple over GF(2) the linear
combinations of 00111 & 11101 are
26
Modern Linear Abstract Algebra
27
Modern Linear Abstract Algebra
➢ Vector Spaces Vn :
➢ Statement:
➢ Let S be a k-dimensional subspace of the vector space Vn of n-tuple
over GF(2).
➢ The dimension of its null space Sd is in n-k. in other words ,
𝑑𝑖𝑚 𝑆 + dim 𝑆𝑑 = 𝑛
➢ Irreducible polynomial:
➢ For a polynomial 𝑓(𝑋) over 𝐺𝐹(2), if polynomial has an even number
of terms, it is devisable by 𝑋 + 1.
➢ A polynomial 𝑝(𝑋) over 𝐺𝐹(2) of degree m is said to be irreducible
over 𝑝(𝑋). If it is not divisible by any polynomial over 𝐺𝐹(2) of degree
less than m but greater than zero.
28
Modern Abstract linear Algebra
➢Primitive elements
➢ n = 2m - 1
Modern Abstract linear Algebra
➢ where, n = 2m - 1
Irreducible Polynomial P(X) of degree
m, over GF={0,1}
➢Example 1, P(X)=X3 + X + 1 over GF(2)={0,1}
➢P(0)=03 + 0 + 1
=1
➢P(1)=13 + 1 + 1
=1
Example 2
Primitive element α and Primitive
Polynomial P(X) of degree m
➢ Theorems:
➢ 1.If using powers of a single element α , all elements
of the set are obtained except zero element then a
element α is called as primitive elements
➢ 2. An irreducible Polynomial P(X) of degree m is said to
be primitive, if it divides the polynomial Xn + 1 over
GF(2), where n is the smallest integer value and
➢ where, n = 2m – 1
➢ Check whether polynomial P(X)=X3 + X + 1 over GF(2)={0,1} is
primitive or not
Modern Linear Abstract Algebra
➢ Verify whether the set G ={0,1,2,3,4} under mod
5 operation is a group or not
➢ Give any one example of finite group
➢ Verify whether the set F ={0,1,2,3,4,5,6} under
mod-7 is a field or not
➢ Give one example of finite field
➢ Write the basis vector for the vector space V4
over GF(2)
➢ Verify P(X)=X4 + X + 1 is primitive or not over
GF(2)
what is Xn + 1 over GF(2)
A set of vectors is said to span a vector space V if every vector in V is a linear combination of
vectors in set .
36
Modern Linear Abstract Algebra
37
Primitive polynomial
➢ An irreducible polynomial P(X) of degree m is said to be primitive if the
smallest positive integer n for which p(X) divides Xn+1 where, n=2m-1
➢ For Example Consider P(X)= 𝑋 3 + 𝑋 + 1 is irreducible polynomial over
GF(2)
38
Primitive Polynomial