9/24/2013

Information Theory and Coding

ECE533

Foundation
Group

jaj
Ring
Group/Ring/Field Field

Nikesh Bajaj
nikesh.14730@lpu.co.in
Asst. Prof., ECE Dept.
Lovely Professional University 2 By Nikesh Bajaj

Group
Group <G, *>

Closure
Associative
Ba

Field Theory
Infinite field
Finite field

Identity Element
sh
Inverse Element
Commutative
Finite/Infinite Group and Order of G
Abelian Group +
Subgroup H < G
Proper /Improper subgroup
3 By Nikesh Bajaj 4 By Nikesh Bajaj
ke

Field Properties of Finite Field

Closure under addition
<F, +, .>
Ni

Associativity of addition
Additive identity
Additive inverse
Commutativity of addition

Closure under multiplication

Associativity of multiplication
Distributive laws
Commutativity of multiplication
Multiplicative identity
No zero divisors
5 By Nikesh Bajaj 6 Multiplicative Inverse By Nikesh Bajaj

1
 9/24/2013

Finite field Modular Arithmetic

(A1) Closure: Additive Inverse
If a and b belong to G, then a b is also in G. Multiplicative Inverse

jaj
(A2) Associative:
a (b c) = (a b) c for all a, b, c in G.
(A3) Identity element:
There is an element e in G such that a e = e a = a for all a in G.
(A4) Inverse element:
For each a in G there is an element a' in G such that a a' = a' a = e.
(M4) Commutativity of multiplication:
ab = ba for all a, b in R

7 By Nikesh Bajaj 8 By Nikesh Bajaj

Modular Arithmetic
Congruent modulo n

if (a mod n) = (b mod n)
Then a b (mod n)
73 4 (mod 23);
Ba

Properties of Congruences
a b (mod n) if n|(a-b)
a b (mod n) implies b a (mod n)
a b (mod n) and b c(mod n)
21 -9 (mod 10) imply ac (mod n)
sh
Divisor
b divides a if a = mb for some m, where a, b, and m are integers
b divides a b|a
23 8 (mod 5) because 23-8 = 15 = 5 3
If a|1, then a = 1
-11 5 (mod 8) because -11-5 = -16 = 8 x (-2)
If a|b and b|a, then a = b
81 0 (mod 27) because 81-0 = 81 = 27 x 3
Any b 0 , divides 0
If b|g and b|h, then b|(mg + nh) for arbitrary integers m and n
9 if a 0 (mod n), then n|a By Nikesh Bajaj 10 By Nikesh Bajaj
ke

Properties of Modulo Arithmetic GF(2), GF(3), GF(4)

(a + b) mod n= [(a mod n) + (b mod n)] mod n Addition/ Multiplication table
Ni

(a - b) mod n =[(a mod n) - (b mod n)] mod n

(a x b) mod n =[(a mod n) x (b mod n)] mod n
Exponential Modulo
xm mod n = (x mod n)m mod n

11 By Nikesh Bajaj 12 By Nikesh Bajaj

2
 9/24/2013

What you should know?

What is Field and Why we need it
How to Verify whether given GF is valid filed

jaj

or not
check GF(2), GF(3), GF(4), GF(5), GF(6) GF(7)
Make + and X table, check all properties
How to do computations in particular field
3+4 in GF(5) or 3+4 in GF(7)
in GF(11)

13 By Nikesh Bajaj

Ba
sh
ke
Ni