Linear Block Codes vs Convolutional Codes:

Block codes produce n output bits

For each period, convolutional
from k input bits, where k and n
1 codes use a small number of input
are very big numbers. K is the
. bits and generate a small number
number of message bits (when
of output bits. (where K=1).
k>1)

Information bits in convolutional

Information bits are immediately
2 codes are distributed throughout
followed by parity bits in linear
. the sequence rather than being
block codes.
followed by parity bits.

Since the current state's encoding

It has a memory element for storing
is independent of the past state, it
3 prior state data since encoding of
lacks a memory component. It
. the present state depends on the
simply depends on the current
previous state and past elements.
message bit.

Block codes are favoured because Non-systematic convolutional

they are organised and have a
4
good structure. Example: The
.
position of the parity or check bits
is clearly stated.
codes are chosen because they
lack an efficient structure, such as
a fixed place for the parity or check
bits.
 Burst error detection and
5 Block codes can be used to
prevention are suited for
. identify and stop random faults.
convolutional codes.

Convolutional Codes have a more

Block codes' hardware is intricate,
6 straightforward hardware design,
and the encoding procedure is a
. and the encoding procedure is
little challenging.
simple.

Hamming codes, BCH codes,

7 cyclic codes, and Reed-Solomon Turbo codes and Trellis codes are
. codes are examples of linear block examples of convolutional codes.
codes.