Scribd
Upload
17 views

Error Control Coding: (3+0) Credits

This document provides an introduction to error control coding and concepts in abstract algebra including groups, subgroups, cosets, fields, vector spaces, and linear algebra. Key topics covered include the definition of groups, subgroups, cosets, finite fields GF(2m) constructed using primitive polynomials, vector spaces, basis, linear independence, subspaces, generator and parity check matrices for coding. Students are provided with homework practice problems focusing on these algebraic concepts.

Uploaded by

WA Q AS
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
17 views

Error Control Coding: (3+0) Credits

This document provides an introduction to error control coding and concepts in abstract algebra including groups, subgroups, cosets, fields, vector spaces, and linear algebra. Key topics covered include the definition of groups, subgroups, cosets, finite fields GF(2m) constructed using primitive polynomials, vector spaces, basis, linear independence, subspaces, generator and parity check matrices for coding. Students are provided with homework practice problems focusing on these algebraic concepts.

Uploaded by

WA Q AS
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 34

Error control coding

EEE 470
credits
Spring 2015
Instructor: Dr.Hafiz M.Asif

(3+0)

Introduction to algebra:
Group A set on which a binary
operation * is defined is called a
group if
1. The binary operation is associative
2. G contains a unique element such that,
for any in G, is the identity element
3. Inverse exists

Commutative group

Groups:
G is closed under addition
Order of the group: number of
elements
Finite group
Example 2.2

Subgroup:
Definition: A subgroup of a group G is
a subset H of G that is itself a group
under the operation of G:
H is closed under the operation of G.

Example:
Is G group under modulo-2 addition
()? Is G commutative.

Example:
G1 = Z16 = {0, 1, . . . , 15} with mod
16 addition.
G1 has one subgroup with 8 elements,
the set of even integers {0, 2, . . . ,
14}.

Coset:
A subgroup H can be thought of as a
smaller dimensional subspace of G.
H can be translated by adding a
fixed element g (in G) to every
element of H
These translates are called cosets.

Coset:
Every element in G appears in one
and only one coset of H
All the distinct cosets of H are
disjoint
The union of all the distinct cosets of
H forms the group G

Fields:

Example 2.5:

Example 2.6

Binary field:
GF(2) is a binary field under modulo2 +/.
1+1=2=0, 1=-1

Polynomials:
GF(2m) is an extension field of GF(2)
(analogous to real vs. complex
numbers)
Consists of 2m elements
Formed using polynomials
Polynomial over GF(2) means
polynomial with coefficients from
GF(2)

Irreducible polynomial:
A
polynomial p(X) over GF(2) of
degree m is said to be irreducible if
p(X) is not divisible by any
polynomial (over GF(2)) of degree
less than m.
An irreducible polynomial over GF(2)
of degree m divides where
i
i
2
2
[f(X)] =f(X ) for GF(2)
(a+b)2=a2+b2

Primitive polynomial:
The

irreducible polynomial is
primitive if the smallest positive
integer divides
Primitive irreducible (but not vice
versa)
(primitive and irreducible)
(irreducible) , it divides

Primitive polynomial:
Not

easy to recognize primitive


polynomials
Tables available (from classical work)
For a given degree , more than one
primitive polynomials are possible

Construction of GF(2 ):
m

elements
Representation:
Remember, (verify please!)
primitive element (generator of
the multiplicative group of F)
The construction is based on
primitive polynomial of degree

Example 2.7:

Basic properties of GF(2 ):


m

Polynomials

over GF(2), which do not


have roots from GF(2), may have
roots from GF(2m)
Example: (irreducible)
No roots from GF(2) but four roots
from GF() [verify please]
()()()()= [verify please]

Conjugate of the root:

Example: ( is a root)


Minimal polynomial

Minimal polynomial


is the smallest nonnegative integer
such that
Example 2.8

Article 2.6:
Solution

of homogeneous equations
over GF()
Do yourself

Vector space:

Vector space:
Elements of V vectors (V is a
vector space over field F,e.g., GF(2))
Elements of F scalars
Example 2.12

Subspace S:

S a subset of vector space V (also


a vector space over F)
Example 2.13

Subspace and linear


combination:

is a linear combination of
Example 2.14

Linearly independent
vectors:
The

vectors, , are said to be linearly


independent iff there exist scalars
form F, not all zero, such that
Example 2.15

Basis of

Basis

Set of linearly independent


vectors that span the vector space
(or subspace)
The number of vectors in basis is
called the dimension of the vector
space

Subspace formation:
If

and
are linearly independent
vectors in then these vectors will
span subspace
possible linear combinations form
subspace

Subspace andnull space :

Both

and (null space) are subspaces of


The elements (n-k) of are also linearly
independent
Example 2.16

Matrix representation:
Generator matrix
K linearly independent
rows (k-tuple)
(rows from )
Row-space: linear
combinations (k-dim
subspace)
Elementary row
operationsno effect
Example 2.17

Parity check matrix

Represents

null space
linearly independent rows (rows
from )
Row-space: linear combinations ()
Elementary row operationsno
effect
Example 2.17

Orthogonality of and

Practice problems:

Home Work Suggestions:


2.1-3,2.10,2.13,2.14,2.17,2.19,2.25,2.26

You might also like