World Applied Programming, Vol (1), No (5), December 2011.

339-345
ISSN: 2222-2510
2011 WAP journal. www.waprogramming.com

A Novel Method for Coding Theory

With the Help of a Class of Matrices
Balakrishnan Vellaikannan

Dr. V. Mohan

Assistant Professor of Mathematics

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

Professor and Head of Mathematics

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

Abstract: A novel approach which incorporates the salient features of message sharing (Called coding
theory) is presented and also extended to the messages of higher length. The proposed method is very
simple in its principle and has great potential to be applied to other situations where the exchange of
messages is done confidentially.
Key word: Matrices Matrix Multiplication Inverse Matrix Invertible Matrices Diagonal
matrices Matrix induced by a Quadratic form Matrix induced by Eigen values Encoder
Decoder Message Matrix
I.

INTRODUCTION

Coding theory is a subject by which the exchange of messages is administered in a confidential and more
secured way having a wide application in Military operations, Banking Transactions, the places where more
messages are combined to reveal a hidden message etc Recently there has been a wide application of
inversion of matrices (of order 2 whose inverses are readily obtained) [1], [2] to the problem of exchange of
messages in a confidential and a secured way. In the proposed method the idea has been extended to a class of
matrices (diagonal matrices mainly to nonsingular diagonal matrices (obtained from many sources)) right from
scalar matrices, especially induced from Quadratic forms as in[4], with he help of eigen values and eigen vectors
from an arbitrary non singular matrix as in [5],With the help of degree matrix of a Graph etc.
The newly designed method introduced in this paper avoids the difficulties in the determination of inverse of a
nonsingular matrix. The results obtained using this are very good and this method works very well for the whole
range of message exchanging problems and the excellent agreement with the existing one. The versatility of the
method is that it is suitable from the beginners to the toppers in the field of matrices with their individual coding.
1.1 Theorem
A text message of strings of some length / size l can be converted in to a matrix (called a message matrix M) of

size m x n where n < m and n is the least such that mx n l depending up on the length of
the message with help of suitably chosen numerals and zeros.
Proof:
The proof is by enumeration on numbers.
Consider the following:
For the text message of length up to l = 9 ; then we have

m = 3 ; n = 3.

Similarly For the text message of length up to l = 12 we have m = 4 ; n = 3 . and so on. Hence the proof.
II.

BASICS (USE OF SIMPLE SCALAR MATRIX)

Consider the text message: I LOVE MATHEMATICS

339

Balakrishnan Vellaikannan et al., World Applied Programming (WAP), Vol (1), No (5), December 2011.

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 as

I
L O V E
5 0 -6 8 -11 3 0

MAT H EMA T IC S
7 1-10 -4 3 7 1 -10 5 2 10

Now we rearrange these numbers in to a matrix M (Row wise e/ Coolum wise).we use row wise here. For our
case, we have
0
6
5

11 3
8
M = 0
7
1

3
10 4
7
1 10

5
2
10

of order

(6 3) (Using Theorem)

Then we perform the product M A, where A is an arbitrary nonsingular matrix given by

2 0 0

A = 0 2 0 Whose inverse is given by A 1

0 0 2

Then, we get
0
6
5

11 3
8
7
1
X = MA= 0

3
10 4
7
1 10

5
2
10

2
= 0

0
1
2
0

0
12
10

16

22
6

2
0
0

14
2
0 2 0 =

6
0 0 2 20 8

2
20
14
10
4
20

The encoded numeric message to be sent is

10, 0, -12, 16,10,4,20.

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

M = XA

0
12 1
10

6 2
16 22

= 0
14
2 0

6
20 8

14
2
20 0

10
4
20

0
1
2
0

0
6
5
0 8 11 3

of order 6 x3
=
0
7
1
0

10 4
3
1
7
1 10

2
2
10
5

This matrix is again converted in to a string of numerals as

I
L O V E
5 0 -6 8 -11 3 0

MAT H EMAT IC S
7 1-10 -4 3 7 1 -10 5 2 10

340

Balakrishnan Vellaikannan et al., World Applied Programming (WAP), Vol (1), No (5), December 2011.

III.

SOLUTION PROCEDURE

A text message of strings of some length / size l from the sender is converted in to a stream of numerals with
the help of some coding process (Probably may be the standard codes like A 1, B-2,.Z-26 and for space -0 )
which is again converted in to a matrix (called a message matrix M) of size m x n where

n < m and n is the least such that mx n l depending up on the length of the message .In such
case the size of the Encoder (The induced Diagonal matrix of a Quadratic form of suitable variables )
becomes n . Then the Encoder need not be an arbitrary matrix where as it may be taken as a Diagonal matrix of
size n whose inverse can be readily obtained.
Then 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

) , to get the message matrix

back as M = XE .Then with the previously used codes the receiver can get back the message in terms of the
numerals which again can be converted to the original text message. When the length / size of the text message is
too large, the value of n become higher, leading to the need of higher order diagonal matrices induced from the
quadratic forms of higher number of variables.
3. 1 Algorithm
3.1.1 Encoding Process
1.
2.

Convert the text message of length l in to a stream of Numerals using a user friendly scheme for
both the sender and the receiver.
Place
the
numerals
in
to
a
matrix
of
order
m n where

n < m and n is the least such that mx n l where n depends on the size of the
3.
4.

message and call this as a Message matrix M.

Multiply this message matrix by the Encoder E of size n. (Normally an induced diagonal 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.1 .2 Decoding Process

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

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

RESULTS AND DISCUSSIONS (USE OF DIAGONAL MATRIX INDUCED FROM A QUADRATIC FORM)

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.

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 (Here we admit a single spacing between the numerals
for the purpose better understanding)
2 5 19

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

20 0 23 which is of
M =
9 19 8

5 19 0

order 4 x3. (Using Theorem)

341

Balakrishnan Vellaikannan et al., World Applied Programming (WAP), Vol (1), No (5), December 2011.

3.

Based on this, We take the 3rd order Diagonal matrix (The diagonal zed matrix of the matrix of a QF of
suitable variables otherwise called the matrix of the canonical form) with Diag (
)). For e:g if the
QF is 2 x1 + x 2 + x 3 + 2 x1 x 2 2 x1 x 3 4 x 2 x 3 then the matrix of the QF is
2

1 1
2

. Also the canonical form is

1 2
1
1 2 1

y1 + y 2 + 4 y 3 whose matrix is given by

2

1 0 0

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

4.

5.

1 0 0
Then we have the Encoder as E = 0 1 0 .

0 0 4

Then the encoded matrix is given by

2 5 19
2 5 76

1 0 0

20 0 92 .
20 0 23
X = ME =
0 1 0 =
9 19 8
9 19 32

0 0 4
5 19 0
5 19 0

Hence the encoded numeric message is given by

-2 5 76 -20 0 92 -9 19 32 -5 19 0

1 0 0
6. Clearly the Decoder E is the given by E 1 = 0 1 0 .

1
0 0

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

M = XE 1

8.

2 5 76

1 0
20 0 92
=
0 1
9 19 32

5 19 0 0 0

2 5 19

0
20 0 23 .

0 =

1 9 19 8

4 5 19 0

This matrix M is converted in to numeric message 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. 1 A word on Security:
In case of using the standard codes one could recognize intuitively or by any way the codes of use from the
codes allotted for the alphabets. So the use of codes in a random or chaotic way or by using some process
increases the security level.

4.1.1 Example
Instead of using the standard codes A-1, B-2.Z-26 and 0 for space if we use the codes assigned as
A-7 , B-6 , C- 5 , D-4 , E-3 ,F-2 ,G-1 , H-8 , I-9 , J-10 , K-11 , L-12 , M-13 . N- 15 , O-16, P-17 , Q- 18 , R- 19,
S-14 , T-20 , U-26 , V-25 , W-24 , X- 23 , Y -22 ,Z- 21 and 0 for space.(In a random way or by using some
generator using Number theory or combinatorics)

342

Balakrishnan Vellaikannan et al., World Applied Programming (WAP), Vol (1), No (5), December 2011.

Then the message BEST WISHES is given by the matrix

2 5 19
3 14
6

20 0 24 Instead of M = 20 0 23
1
M =
9 19 8
9 14 8

5 19 0
3 114 0

Any one who intervene the communication uses the standard codes for this message matrix will get a confusing
message like FENT XINHCN.
So the messengers are advised to make use of their convenient system of codes in order to have higher security
level.
V.

OPERATION ON STRINGS:

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

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.
6.1 Illustration: (Use of Diagonal Matrix induced from an arbitrary non singular matrix)
Consider the Message M: MATHEMATICS IS THE QUEEN OF SCIENCES.
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)

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
2)
.
T1 =
3 19 0
9 19 0

20 8 5

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

2 2 7

2 1 2
0 1 3

). For e:g if the matrix N is

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)

E=

0
0

1
0 0
4

1 0 0

Such that
1 0
1
0 3 0
E 1 = 0

0 0 4
3

343

Then the encoder matrix is given by

Balakrishnan Vellaikannan et al., World Applied Programming (WAP), Vol (1), No (5), December 2011.

5)

13

8
X 1 = T1E = 1

3
9

20

15
60
57
57
24

13

8
1

3
9

20

M 1 = X 1 E 1 =

6)

80

52
36

0
0
20

3
15
60
57
57
24

80

52
36

0
0
20

1
0

13 1 20

8 5 13

0 0
1 20 9
1

0 =

3
3 19 0
1
9 19 0
0

4
20 8 5

7) 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)

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

14

5
15
T2 =
19
5

21 5

14 0
6 0 .

3 9
14 3
19 0

1 0

3)

4)

0 Such that E 1
0 0 4

E = 0 3

14

5
X 2 = T2 E = 15
15
5

1
= 0

0 0
1
0

3
1
0
4

63 20

42
0
18
0 ,

9 36
42 12
57
0

344

Balakrishnan Vellaikannan et al., World Applied Programming (WAP), Vol (1), No (5), December 2011.

5)

M 2 = X 2 E 1 =

14

5
15

15
5

63 20

42
0
18
0

9 36
42 12
57
0

6) Message 2 = Q U E E N O F

1 0
0 1

0 0

14 21

5 14
0
15 6
=

1
19 3

5 14
4

5 19

0
0

9
3
0

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.

VII. RESULTS USED FROM MATRIX THEORY

The following are the results used in our paper from the theory of matrices available in [3]
1. To any Quadratic there exists a matrix called the Matrix of quadratic form.
2. The matrix of any Quadratic form is a Real Symmetric matrix.
3. The Eigen values of a real symmetric matrix are always real.
4. Any Quadratic form can be reduced to canonical form by means of orthogonal reduction.
5. The matrix of the canonical form of a Quadratic form is a diagonal matrix.
6.

The inverse of a diagonal matrix with a ii as entries is nothing but the scalar diagonal matrix with

7.

as entries.
Any non singular square matrix can be digitalized by means of its eigen values and eigen vectors.

1
a ii

VIII. CONCLUSION

1.
2.

3.
4.
5.

Diagonal matrices induced from various matrices are preferred for encoding as their inverses can be
easily obtained.
This provides a transaction of least amount of messaging between the sender and the receiver. (It is
sufficient to know the codes of use and the Quadratic form).Here the security is assured as only those
know about the Quadratic Forms can understand the process.
Higher order Diagonal matrices are preferred as their inverses are easily found.
When the size of the message is too large new string operations may be defined and the message can be
spitted and suitable such processing may be carried over.
Higher level of security can be achieved by using own conventional codes or codes (As in the word on
Security) processed by some structure.
IX.

1.
2.
3.
4.

SCOPE IN FURTHER WORK

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

Higher level of security can be enhanced by using structured system of codes.
Search of Diagonal matrices induced from any other field may be done.
Efforts can be taken for the use of any non singular matrix as an Encoder
REFERENCES

[1]
[2]
[3]
[4]
[5]

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

http:// aix1.uottawa.ca/~jkhoury/cryptography.htm
Vatsa B.S., Suchi Vatsa.,Theory of Matrices., Third edition., New Age International , India., 2010.
B.Vellaikannan , Dr.V.Mohan , V.Gnanaraj The Role of Eigen values and Eigen Vectors in Coding Theory European Journal of
Scientific Research, Vol.59 , No.1 (2011) , pp 85-92.
B.Vellaikannan , Dr.V.Mohan , V.Gnanaraj A Note on the application of quadratic forms in Coding Theory with a note on security
International Journal of Computer technology and Applications , Vol.1 (1) (2011) , pp 78-87.

345