World Applied Programming, Vol (1), No (3), August 2011.

167-175
ISSN: 2222-2510
2011 WAP journal. www.waprogramming.com

A Note on the Application of Eigen Vectors

in Coding Theory
B.Vellaikannan*

V.Mohan

Assitant Professor of Mathematics

Thiagarajar College of Engineering,
Madurai - 625 015. Tamil Nadu , India
bvkmat@tce.edu

Professor and HOD of Mathematics

Thiagarajar College of Engineering,
Madurai - 625 015. Tamil Nadu , India
vmohan@tce.edu

Abstract: It is well known that coding theory is the subject which has wide application in science and Technology especially in
information technology where messages are exchanged with secrets. In this paper we extend this concept with which the
exchange of secret / confidential matters are administered in comparatively at an easier method using the matrices
induced by eigen values and eigen vectors of a Non singular matrix .The concept is illustrated with an example.
Key words: Eigen values Eigen vectors - Matrices Invertible Matrices Diagonal matrices - Encoder Decoder Message
Matrix.

1. INTRODUCTION
The word of the "coding" is one of the most widespread in modern computer science. What means the concept of the "coding"? The "coding" is
perceived as the operation of the identification of the symbols or the symbol groups of one code to the symbols or the symbol groups of other
code. The necessity of the "coding" arises first of all from need to adapt the form of message to the given "communication channel" or to some
device intended for transformation, conversion or storage of information. The Coding Theory has a long history; The number systems intended
for number representation were the first codes. The next very old direction of the coding theory is the cryptography or secret coding. This one
takes its origin in the Egyptian science dating back almost 4000 years ago, to the time when the Egyptians used the hieroglyphic code for
inscriptions on the tombs. Development of the modern coding theory was stimulated by the progress of the communication systems. Shannon's
information theory based on the entropy concept is mathematical justification of the effective code theory. The Morse, Shannon-Fano and
Hoffman codes are the examples of the effective codes.

2. PROBLEM DESCRIPTION
2.1 Present work
There are many ways to encode a message. And the use of coding has become particularly significant in recent years (due to the
explosion of the internet for example). One way to encode a message uses matrices and their inverse. Indeed, consider a fixed invertible matrix
A of a Quadratic form. Convert the message into a matrix B such that AB is possible to perform. Send the message generated by AB. At the other
end, they will need to know A-1 in order to decode the message sent.
Indeed, we have

which is the original message. Keep in mind that whenever an undesired intruder finds A, we must be able to change it. So we should have a
mechanical way of generating simple matrices A which are invertible and have simple inverse matrices. Note that, in general, the inverse of a
matrix involves fractions which are not easy to send in an electronic form. The best is to have both A and its inverse with integers as their
entries. In fact, we can use our previous knowledge to generate such class of matrices. Indeed, if A is a matrix such that its determinant is
and all its entries are integers, then A-1 will have entries which are integers. So how do we generate such class of matrices? One practical way is
to start with an upper triangular matrix with
on the diagonal and integer-entries. Then we use the elementary row operations to change the
matrix while keeping the determinant unchanged. Do not multiply rows with non-integers while doing elementary row operations
2.2 Example.
Consider the matrix

167

B.Vellaikannan et al., World Applied Programming, Vol (1), No (3), August 2011.

First we keep the first row and add it to the second as well as to the third rows. We obtain

Next we keep the first row again, we add the second to the third, and finally add the last one to the first multiplied by -2. We obtain

This is our matrix A. Easy calculations will give det (A) = -1, which we knew since the above elementary operations did not change the
determinant from the original triangular matrix which obviously has -1 as its determinant. We leave the details of the calculations to the reader.
The inverse of A is

2.3 Problem.
Consider the message

I LOVE VINODHINI
To every letter we will associate a number. The easiest way to do that is to associate 0 to a blank or space, 1 to A, 2 to B, etc... Another way is to
associate 0 to a blank or space, 1 to A, -1 to B, 2 to C, -2 to D, etc... Let us use the second choice. So our message is given by the string
I
5 0

L O V E
V I N O D H I N I
-6 8 -11 3 0 -11 5 -7 8 -2 -4 5 -7 5

Now we rearrange these numbers into a matrix B. For example, we have

8
0 7 4 5
5

M = 0
11 11 8
5 0
6 3
5 2 7 0

Then we perform the product AB, where A is the matrix found above. We get

X = AM =

66 60 49
36
5
1

14 10
52 116 86 88
7
69
65 51 35
5

The encoded message to be sent is

1, -52, -7, -66,-5,-10,-5.

This encoded message is again decoded using the inverse of A as

168

B.Vellaikannan et al., World Applied Programming, Vol (1), No (3), August 2011.

M=

A X

8
0 7 4 5
5

= 0 11 11 8
5 0
6 3
5 2 7 0

This matrix is again converted in to a string as

5
I

-6 8 -11 3

LOV E

-11 5 -7 8 -2 -4 5 -7 5
V I N O D H I N I

3. PROPOSED WORK
3.1

Problem Description and Algorithm

Our problem is to exchange the secret and confidential messages using coding theory in which inversion of Diagonal
matrices induced from any non singular matrix r are used.
At present [1], [2] a message of strings of some length / size from the sender is converted in to a stream of numerals which
is again converted in to a matrix (called a message matrix M) normally an m 2 matrix based on the number of characters in the message
where m is an integer, with the help of an user friendly code (Probably may be the standard codes like A 1, B-2,.Z-26 and for space -0 ) .
Then with the help of an invertible matrix E (Encoder Matrix), normally a 2 2 matrix whose inverse can be easily obtained, the message
matrix is converted in to a New Matrix X (Encoded Matrix) using Matrix Multiplication as X = ME . Then this is sent to the Receiver. Then
the receiver decode this matrix with the help of a matrix D (Decoder matrix) which is nothing but the inverse of the encoder

(i.e., D = E 1 ) ,

to get the message matrix back as M = XE .Then with the previously used codes he can get back the message. When the size of the text
message is too large, the value of m become greater leading to more computational time and errors which is not preferred.
As in the era of computer, finding the inverse of a non singular matrix of any order is possible with the help of latest available
soft wares, it will not be a problem of finding the inverse of matrices of large size. So in this paper we propose a method where the Message
Matrix need not be always a m 2 matrix where as it is a matrix of size n m where m takes n or n-1depending up on the length of the
message .In such case the size of the Encoder (The induced Diagonal matrix of a Quadratic form) becomes m. Also the Encoder / Decoder need
not be an arbitrary matrix where as it may be taken as a Diagonal matrix of size m whose inverse can be easily obtained.
3. 2 Algorithm
3.2.1Encoding Process:
1.
2.
3.
4.

Convert the text message in to a stream of Numerical values using a user

friendly scheme.
Place the data in to a matrix of order n m where m = n or n 1 , where n depends on the size of the message and
call this as a Message matrix M.
Multiply this message matrix by the Encoder E of size m. (Normally a induced diagonal matrix of eigen values of a nonsingular
matrix compatible for the product X = ME and get the encoded matrix X.
Convert the message matrix in to the stream of numbers that contains the encrypted message and sent to the receiver.

3.2 .1 Decoding Process:

1. Place the encrypted stream of numbers that represent the encrypted message in to a matrix
2.
3.
4.

Multiply the encoded matrix X with the decoder D = E (The inverse of E) to get back the message matrix M
Convert this message matrix in to a stream of numbers with the help of the originally used scheme.
Convert this stream of numbers in to the text of the original message.

3. 2.3 Example;
Consider the message to be sent: BEST WISHES

169

B.Vellaikannan et al., World Applied Programming, Vol (1), No (3), August 2011.
We take the standard codes as follows:

A 1 ; B 2 ; ........; Z 26 and Space 0

1.
2.

We convert the above message in to a stream of numerical values as follows:

BEST WISHES 2 5 19 20 0 23 9 19 8 5 19
We construct the message matrix M with this stream of numerals as

2 5 19

20 0 23
M =
9 19 8

5 19 0

3.

which is of order

4 x 3.

We take the 3rd order Diagonal matrix (The diagonal matrix of the eigen values of a Non singular matrix N with Diag (

). For e:g if the matrix N is

The encoder matrix is given by

2 2 7

2 1 2
0 1 3

. Then

1 0 0

E = D(1, 3 , 4 ) = 0 3 0
0 0 4

Where 1 , 3 ,-4 are the eigen values of N.

4 Then the encoded matrix is given by

2 15 76

20 0 92
X = ME =
9 57 32

5 57

Hence the encoded message is given by

-2 15 -76 20 0 -92 9 57 -32 5 57 0

5. Clearly the Decoder

E 1

is the given by E

1
= 0

0 0
1
0 .

3
1
0
4

6. The encoded message is to be decoded by first writing the encoded matrix X from the received message. as

M = XE 1

2 5 19

20 0 23
=
9 19 8

5 19 0

This matrix M is converted in to stream of numerals as

2 5 19 20 0 23 9 19 8 5 19

8.

This stream of numerals is converted in to the text message as

2 5 19 20 0 23 9 19 8 5 19: BEST WISHES

170

B.Vellaikannan et al., World Applied Programming, Vol (1), No (3), August 2011.
3. 2 Algorithm
3.2.1Encoding Process:
1.
2.
3.
4.

1. Convert the text message in to a stream of Numerical values using a user friendly scheme.
Place the data in to a matrix of order n m where m = n or n 1 , where n depends on the size of the message and
call this as a Message matrix M.
Multiply this message matrix by the Encoder E of size m. (Normally a induced diagonal matrix of eigen values of a
nonsingular matrix compatible for the product X = ME .) and get the encoded matrix X.
Convert the message matrix in to the stream of numbers that contains the encrypted message and sent to the receiver.

3.2 .1 Decoding Process:

1.

Place the encrypted stream of numbers that represent the encrypted message in to a matrix

2.
3.
4.

Multiply the encoded matrix X with the decoder D = E (The inverse of E) to get back the message matrix M
Convert this message matrix in to a stream of numbers with the help of the originally used scheme.
Convert this stream of numbers in to the text of the original message.

3. 2.3 Example;
Consider the message to be sent: BEST WISHES
We take the standard codes as follows:

A 1 ; B 2 ; ........; Z 26 and Space 0

1.

We convert the above message in to a stream of numerical values as follows:

BEST WISHES 2 5 19 20 0 23 9 19 8 5 19

2 5 19

20 0 23
M =
9 19 8

5 19 0

We construct the message matrix M with this stream of numerals as

3.

We take the 3rd order Diagonal matrix (The diagonal matrix of the eigen values of a Non singular matrix N with Diag (

if the matrix N is

4.

2 2 7

2 1 2
0 1 3

The encoder matrix is given by

which is of order

4 x 3.

2.

1 0 0

E = D(1, 3 , 4 ) = 0 3 0
0 0 4

Where 1 , 3 ,-4 are the eigen values of N.

5.

Then the encoded matrix is given by

2 5 19
2 15 76

1 0 0

20 0 92
20 0 23
X = ME =
0 3 0 =
9 19 8
9 57 32

0 0 4

5 19 0
5 57

Hence the encoded message is given by

2 15 -76 20 0 -92 9 57 -32 5 57 0

171

). For e:g

B.Vellaikannan et al., World Applied Programming, Vol (1), No (3), August 2011.

6. Clearly the Decoder

E 1

is the given by E

1
= 0

0 0
1
0 .

3
1
0
4

7. The encoded message is to be decoded by first writing the encoded matrix X from the received message. as

M = XE 1

2 5 19

20 0 23
==
9 19 8

5 19 0

8. This matrix M is converted in to stream of numerals as

2 5 19 20 0 23 9 19 8 5 19
9. This stream of numerals is converted in to the text message as
2 5 19 20 0 23 9 19 8 5 19: BEST WISHES

4. OPERATION ON STRINGS
We define the operator * (The string addition) as usual in the case of addition of strings.
Example: Best*wishes = Best wishes.

5. GENERALIZATION
Using this operation we decompose the messages of larger length in to messages of shorter lengths and finally these are coined to get the
message of larger length.
5.1 Illustration:
Consider the Message M: MATHEMATICS IS THE QUEEN OFSCIENCES.
This message is decomposed in to two messages as follows,
M = M1 + M2 Where M1 = MATHEMATICS IS THE & M2 = QUEEN OFSCIENCES.
.
Now for M1:
1)

2)

M A T H E M A T I C S
IS T H E
13 1 20 8 5 13 1 20 9 3 19 0 9 19 0 20 8 5

13 1 20

8 5 13
1 20 9
.
T1 =
3 19 0
9 19 0

20 8 5

172

B.Vellaikannan et al., World Applied Programming, Vol (1), No (3), August 2011.

3)

1 0 0

E = 0 3 0
0 0 4

4)

13

8
1
X 1 = T1E =
3
9

20

5)

Such that

3
15
60
57
57
24

13

8
1

3
9

20

M 1 = X 1 E 1 =

E 1

1
= 0

0 0
1
0

3
1
0
4

80

12
76

0
0
20

3
15
60
57
57
24

80

12
76

0
0
20

1
0

0 0
1
0

3
1
0
4

6) Message 1 = M A T H E M A T I C S
IS T H E
13 1 20 8 5 13 1 20 9 3 19 0 9 19 0 20 8 5

Now for M2:

1)

2)

3)

Q U E E N O F S C I E N C E S
17 21 5 5 14 0 15 6 0 19 3 9 5 14 3 5 19 0

17

5
15
T2 =
19
5

21
14
6
3
14
19

0
0
.
9
3
0

1 0 0

E = 0 3 0
0 0 4

Such that

E 1

1
= 0

0 0
1
0

3
1
0
4

173

13 1 20

8 5 13
1 20 9

3 19 0
9 19 0

20 8 5

B.Vellaikannan et al., World Applied Programming, Vol (1), No (3), August 2011.

4)

5)

17

5
15
X 2 = T2 E =
15
5

M 2 = X 2 E 1 =

63 20

42
0
18
0
,
9 36
42 12
57
0

17

5
15

19
5

21
14
6
3
14
19

0
0

9
3
0

6) Message 2 = Q U E E N O F S C I E N C E S
17 21 5 5 14 0 15 6 0 19 3 9 5 14 3 5 19 0
Therefore the message M = M1 * M2 = MATHEMATICS IS THE QUEEN OF SCIENCES.

6. RESULT USED
1. To any non singular real matrix there exists non zero real Eigen values.
2. Any nonsingular real matrix can be digitalized with suitable transformation where the diagonal elements are the real

Eigen values.

3. In the construction of the diagonal matrix of a nonsingular matrix the eigen values and eigen vectors are used.
4. The inverse of a diagonal matrix with

a ii

as entries is nothing but the scalar diagonal matrix with

1
a ii

as entries.

7. CONCLUSION
1. Diagonal matrices induced from a non singular matrix are preferred for encoding as their inverses can be easily

obtained.

2. This provides a transaction of least amount of messaging between the sender and the receiver. (It is sufficient to convey the codes of use
and the

Eigen values / the non singular matrix).

3. Higher order Diagonal matrices are preferred as their inverses are easily

found.

4. When the size of the message is too large new string operations may be defined and the message can be splitted and suitable such processing
may be carried over.
5. Higher level of security can be achieved by using our own conventional codes or codes processed by some structure.

8. SCOPE IN FURTHER WORK

1.

Texts with all types of characters may be utilized in the study.

2.

Higher level of security can be enhanced by using structured system of codes or the encoder / Decoder.

174

B.Vellaikannan et al., World Applied Programming, Vol (1), No (3), August 2011.

9. REFERENCES
[1].

http://www. richland.edu / james /lecture /.../matrices/applications.html

[2].

http:// aix1.uottawa.ca/~jkhoury/cryptography.htm

[3].

Vatsa B.S., Suchi Vatsa.,Theory of Matrices., Third edition., New Age International , India., 2010.

[4].

H. Eves, Elementary Matrix Theory, Dover publications, 1980.

175