Properties of

Generating Polynomial

RAHUL ARORA
204021
Contents :
1. What is Generating Polynomial ?

2. Properties of generating polynomial .

3. Characteristics of good generating polynomial.

4. Usage of generating polynomial .

What is Generating Polynomial ??

A polynomial code is a linear code

whose set of valid code words consist
of those polynomials that are
divisible by a given fixed polynomial
called the Generating Polynomial . It
is represented by g(x).
Properties of
Generating
Polynomial
1.The relationship among the sent codeword , error,
received codeword( c(x) + e(x) ) and the generator
polynomial g(x) is given by :

Received codeword c(x) + e(x)

_____________
=
g(x) g(x)
2. The length of polynomial code g(x)
should be less than the length of the
message it encodes.

g(x) < Message Bits M(x)

3. In CRC encoding , g(x) should have 1
in both its MSB(most significant bit)
and LSB(least significant bit) positions
. In the process of encoding , CRC bits
are appended to the message so that
the resultant frame is divisible by g(x) .
 4. For Single Bit Error : If the
generator polynomial g(x) has
more than one term and the
cofficient of x^0 is 1, all single
errors can be caught.
5. For two isolated single
bit error : If the generator
polynomial g(x) cannot
divide x^t +1 (t between 0
to n-1) then all isolated
double errors can be
detected .
 6. For odd number of
errors : A generating
polynomial g(x) that
contains a factor of x+1
can detect all the odd
numbered errors.
Characteristics of a Good Generating
Polynomial

It should have atleast two terms.

The cofficient of the term x^0
should be 1.
It should not divide x^t+1,for t
between 2 and n-1.
It should have the factor x+1.
Usage of Good Generating Polynomial

CRC or Cyclic Redundancy Check is a

method of detecting accidental
changes/errors in the communication
channel. CRC uses Generating
Polynomial which is available on both
sender and receiver side.
Represented by g(x)
Thank you!