Equivalence of Linear codes

Dr D D Karunaratna
Equivalence of linear codes
Definition Two linear codes over GF(q) are called equivalent if one
can be obtained from another by the following operations:
1. permutation of the positions of the code(i.e. rearrangement of
the columns of the matrix);
2. multiplication of symbols appearing in a fixed column position by
a non-zero scalar.
 Equivalence of linear codes

Theorem Two k  n matrices generate equivalent linear [n,k] -

codes over GF(q) if one matrix can be obtained from the other
by a sequence of the following operations:
(a) permutation of the rows
(b) multiplication of a row by a non-zero scalar
(c) addition of one row to another
(d) permutation of columns
(e) multiplication of a column by a non-zero scalar
Equivalence of linear codes
The first three operators (a),(b) and (C) replaces one basis by another of the
same code

0 0 0
0 1 
 1 0 1 1
C   A generator matrix is  
1 0 1 1 0 1
 1 1 0 

For example adding the first row to the second one give the following
equivalent generator matrix.
0 1 1
1 1 0
 Equivalence of linear codes
Theorem : Let G be a generator matrix of an [n,k] -code. Then by
operations (a) - (e) the matrix G can be transformed into the form:
[ Ik | A ] where Ik is the k  k identity matrix, and A is a k  (n - k)
matrix.
• The standard form [ Ik | A ] of a generator matrix is not unique.
Example
Convert the generator matrix {011, 101} into the standard form.
Example
Convert the generator matrix {011, 101} into the standard form.
Interchange the rows.

011 101
101 011
 Equivalence of linear codes
Example :

r2 -> r2-r1
r1 -> r1-r2
1 1 1 1 1 1 1 r3-> r3-r1 1 1 1 1 1 1 1  1 0 0 0 1 0 1
1 0 0 0 1 0 1 0 1 1 1 0 1 0 r4-> r4-r2 0 1 1 1 0 1 0 
1 1 0 0 0 1 0 0 0 1 1 1 0 1  0 0 1 1 1 0 1 
0 1 1 0 0 0 1 0 1 1 0 0 0 1  0 0 0 1 0 1 1
r2 -> r2-r3

1 0 0 0 1 0 1 r3 -> r3-r4 1 0 0 0 1 0 1
0 1 0 0 1 1 1  0 1 0 0 1 1 1
0 0 1 0 1 1 0  0 0 1 1 1 0 1
0 0 0 1 0 1 1 0 0 0 1 0 1 1
Example :
Convert the following generator matrix of binary [4,3]-
code into standard form.

0 0 1 1 1 0 1 0 1 0 1 0
0 1 1 0 c1-<->c4
0 1 1 0  r3 = r2+ r3
0 1 1 0 
     
1 1 0 0 0 1 0 1 0 0 1 1
r1 = r1+ r3

1 0 0 0 1 0 0 1
0 1 0 1  r2 = r2+ r3
0 1 1 0 
   
0 0 1 1 0 0 1 1
Example …….
Convert the following generator matrix of binary [4,3]-
code into standard form.

0 0 1 1
0 1 1 0
 
1 1 0 0
Standard form of the generator matrix
 The generator matrix G of a liner [n,k] code can be given as
G = [Ik | P]

Parity check matrix H of G is defined as

H = [PT | In-k]

G HT = 0
Example :
What is the parity check matrix (H) of the following
binary [4,3]-code

1 0 0 0 [0 1 1 1]
0 1 0 1 
 
0 0 1 1
Example :
What is the parity check matrix (H) of the following
binary [7,4]-code

1 0 0 0 1 1 0
0 1 0 0 1 0 1

0 0 1 0 0 1 1
 
0 0 0 1 1 1 1
Example :
What is the parity check matrix (H) of the following
binary [7,4]-code
Parity-check Matrix (H)

1 0 0 0 1 1 0 1 1 0 1 1 0 0
0 1 0 0 1 0 1 1 0 1 1 0 1 0

0 0 1 0 0 1 1 0 1 1 1 0 0 1
 
0 0 0 1 1 1 1