Codeword
Structure :
Block codes accept a block of k message bits and produce a block of
n coded bits. By predetermined rules, n-k redundant bits are added to
the k message bits to form the n coded bits. These codes are referred
to as (n, k) block codes.
Example: a (7,4)
Hamming code.
Table 2.2: Codewords of a (7,4) Hamming Code
Message
|
Codeword
|
Weight
|
Message
|
Codeword
|
Weight
|
0000
|
0000000
|
0
|
1000
|
1101000
|
3
|
0001
|
1010001
|
3
|
1001
|
0111001
|
4
|
0010
|
1110010
|
4
|
1010
|
0011010
|
3
|
0011
|
0100011
|
4
|
1011
|
1001011
|
4
|
0100
|
0110100
|
3
|
1100
|
1011100
|
4
|
0101
|
1100101
|
4
|
1101
|
0001101
|
3
|
0110
|
1000110
|
3
|
1110
|
0101110
|
4
|
0111
|
0010111
|
4
|
1111
|
1111111
|
7
|
Block codes in which
the message bits are included in unaltered form are called systematic
codes. Figure 2.1 shows codeword structure for systematic codes.
Figure 2.1:
Codeword structure
Generator
Matrix G and Encoding operation :
Parity bits are linear sum of the message bits: bi = p0im0 + p1im1 +
+ pk-1,i mk-1 ( +: modulo-2 addition). It can also be written
as:
b = mP .....(2.1)
Generator
Matrix is a k´n matrix defined as
, where
......(2.2)
Encoding operation
is defined as
next>>
|