LINEAR BLOCK

CODING

Presented by:
Pranay Tarang-(N054)
Shaad Haffez-(N069)
Karan Lalan-(N070)
Noise is the main problem in the signal, which disturbs
the reliability of any of the communication
system. Error control coding is the coding procedure
done to control the occurrences of errors. These
techniques help in Error Detection and Error
Correction.

There are many different error correcting codes

depending upon the mathematical principles applied to
them. But, historically, these codes have been classified
into Linear block codes and Convolution codes.
Linear Block Codes
In the linear block codes, the parity bits and message bits have
a linear combination, which means that the resultant code
word is the linear combination of any two code words.
Let us consider some blocks of data, which contains k bits in
each block. These bits are mapped with the blocks which
has n bits in each block. Here n is greater than k. The
transmitter adds redundant bits which are (n-k) bits. The
ratio k/n is the code rate. It is denoted by r and the value
of r is r < 1.
The (n-k) bits added here, are parity bits. Parity bits
help in error detection and error correction, and also in
locating the data. In the data being transmitted, the left
most bits of the code word correspond to the message
bits, and the right most bits of the code word
correspond to the parity bits.
LINEAR BLOCK CODE

In a (n,k) linear block code:

1st portion of k bits is always identical to the
message sequence to be transmitted.

2nd portion of (n-k ) bits are computed from message

bits according to the encoding rule and is called
parity bits.
MINIMUM DISTANCE CONSIDERATIONS:

 Consider a pair of code vectors x and y that

have the same number of elements

 Hamming distance d(x,y): It is defined as the

number of locations in which their respective
elements differ .
 Hamming weight w(x) : It is defined as the
number of elements in the code vector.
 Minimum distance dmin: It is defined as the
smallest hamming distance between any pair of
code vectors in the code or smallest hamming
weight of the non zero code vectors in the code
.
 An (n,k) linear block code has the power to
correct all error patterns of weight t or less if
,and only if
d( ) ≤2t+1
 An (n,k) linear block code of minimum distance dmin
can correct upto 1 error if and only if
t≤ [1/2 (dmin – 1)].
Advantages Disadvantages

Easiest to detect  Transmission

errors. bandwidth is more.
Extra parity bit does not  Extra bit reduces the
convey any information bit rate of transmitter
but detects and and also its power.
corrects errors.
Linear Block Coding vs
Convolution....

In block codes, information bits are followed by parity

bits. In convolution codes, information bits are spread
along the sequence.

Block codes are memoryless whereas Convolution codes

have memory.
APPLICATIONS
 Used for error control coding.
 Storage-magnetic and optical data storage in hard
disks and magnetic tapes and single error
correcting and double error correcting code(SEC-
DEC) used to improve semiconductor memories.
 Communication-satellite and deep space
communications.
THANK YOU!!