Linear Block Codes-Error
Detection and correction
Refer Giridhar Textbook on
Information Theory and Coding for
more information
• Variable length code
A single error which occurs due to noise present
in the channel affects more than one blcok-code
words
• Fixed length code
-Single error will affect only block which can be
easily detected and corrected.
- To detect and correct errors, error control coding
techniques are used that rely on the systematic
addition of “ redundant” symbols
Block diagram of Communication System employing
error control coding
The bit rate of coded output block rc=rb(n/k) bits / sec
Pe=(8x10-4)[3-(2)(8x10-4)]
Pe=0.02x10-4 which is much less than 10-4
• Ie Probability of error Pe is around 2% of desired value
of 10-4
Methods of controlling Errors
i) Forward acting error correction method:
- The method of controlling errors at the receiver
through attempts to correct noise-induced errors
ii) Error detection method:
- The decoder examines the demodulator output, accepts
the received sequence if it matches with a valid
message sequence. If not the decoder discards the
received sequence and notifies the transmitter
regarding error and requests for retransmission of the
message till the correct message sequence is
received. ( Yields lower probability of error)
Types of Errors
• Random Error
- The transmission errors that occur due to the presence of white
Gaussian noise are referred as “ random errors”. Sources of
Gaussian noise include thermal and shot noise in the
transmitting and receiving equipment, thermal noise in the
channel and radiation picked up by the receiving antenna.
• Burst Error
- Impulse noise is characterized by long quiet intervals followed by
high amplitude noise bursts. Examples of impulse noise are
noise that arises due to lighting, switching transients, man-made
noise etc. The noise bursts occur, they affect more than one
symbol and the error caused is called “ Burst Error”
Types of error control codes
• Block Codes
- Block codes consists of ( n-k) number of check bits being
added to k number of information bits to form ‘n’ bit code-
words. These ( n-k) number of check bits are “ derived from k
information bits”. At the receiver, the check bits are used to
detect and correct errors which may occur in the entire n-bit
code words.
• Convolution codes
- In this code, the check bits are continuously interleaved with
information bits. These check bits will help to correct not only
in that particular block but also in other blocks as well.
Linear Block Codes
A (n,k) linear block code is said to be systematic if the k-message bits appear either at
the beginning of the code word or at the end of the code word as depicted in figure
Matrix Description of Linear Codes
In a similar way, the other code-vectors can be found which are listed below
In can be verified that the addition of any two code-vectors ( mod 2 addition ) is
a code-vector belonging to same (6,3) code
Encoding circuit for (n,k) Linear Block Codes
Expanding the matrix of equation 5.9 and equating the corresponding
elements on both sides we get
Example:
For the systematic (6,3) code of example 5.1, the code vector C for a message input (d1 d2 d3) is given by
[c]= [d1 d2 d3 (d1+d3) (d2+d3) (d1+d2)]
Construct the corresponding encoding circuit
Syndrome and Error Correction
In the above equation, the receiver knows only ‘R’ and it does not know C and E. In
order to find E and then C, the receiver does the decoding operation by determining
an (n-k) vector S defined as
d Hence 4th
Binary Cyclic Codes
Algebraic Structures of cyclic codes
• Find the product of polynomials f1(x)=(x+1)
and f2(x)=x3+x+1 using modulo-2 algebra
• Solution:
• f1(x)f2(x)=(x+1)(x3+x+1)=x4+x3+x2+x+x+1
= x4+x3+x2+x(1+1)+ 1
= x4+x3+x2+1
