Back
 ALAMT  Vol.10 No.1 , March 2020
Linear Codes over the Finite Ring Z15
Abstract: In this paper, the structure of the non-chain ring Z15 is studied. The ideals of the ring Z15 are obtained through its non-units and the Lee weights of elements in Z15 are presented. On this basis, by the Chinese Remainder Theorem, we construct a unique expression of an element in Z15. Further, the Gray mapping from Zn15 to Z2n15 is defined and it’s shown to be distance preserved. The relationship between the minimum Lee weight and the minimum Hamming weight of the linear code over the ring Z15 is also obtained and we prove that the Gray map of the linear code over the ring Z15 is also linear.

1. Introduction

Error correcting codes and error detection codes play an important role in data networks and satellite applications. Most coding theory is interested. Linear code has a clear structure and it is easy to find, understand, edit and decode for codes over finite rings. Since the 1970s, there are many research papers about codes over the finite ring. Several good nonlinear binary codes have been discovered. The circulation code on Z4 is composed of a Gary mapping structure [1]. After that, many researchers carried out more and more research on the code of finite ring [2] [3] [4] [5] [6]. The importance of finite rings in algebraic coding theory was established in the early 1990s by observing that some non-linear binary codes actually allow a linear representation of Z4 (see [1] [7]). It is also noted that the codes on the ring are particularly useful, if the distance function in the alphabet is not given by the usual Hamming metric, but by the homogeneous weight [8]. Examples of homogeneous weights are Hamming weights on finite fields and Lee weights on Z4. The homogeneous weight can be a natural extension of the Hamming weight of the code over finite rings.

In this paper, we will concern the linear code over the ring Z15, which has p q elements and p q . In the first section, we get the ideals of the ring Z15 through its non-units and give the Lee weights of elements in Z15. What’s more, we construct a unique expression of an element in Z15. In the second section, we obtain the generate matrix of the dual code of a linear code over the ring 15 , give the definition of Gray mapping from 15 n to 15 2 n and show that this Gray mapping is distance preserved. In the third section, we prove that the minimal Lee weight of C is equal to the minimal Hamming weight of its Gray Mapping. Further, the linear property of the Gray mapping of a linear code is obtained.

2. The Ring 1 5

The ring 15 is a non-chain ring, whose units are {1, 2, 4, 7, 8, 11, 13} and non-units are {0, 3, 5, 6, 9, 10, 12}. It has three ideals as follows,

I ( 0 ) = { 0 } , I ( 3 ) = 3 15 = { 0 , 3 , 6 , 9 , 12 } , I ( 5 ) = 5 15 = { 0 , 5 , 1 0 }

The maximal ideal of the ring 15 are I ( 3 ) and I ( 5 ) , and we have 15 / I ( 3 ) = F 3 and 15 / I ( 5 ) = F 5 . By the Chinese Remainder Theorem, we have

15 = I ( 3 ) I ( 5 ) .

Thus, for every a 15 , a = b 3 + d 5 . Let b I ( 3 ) and d I ( 5 ) , then b and d in the expression are unique. The Lee weight of a 15 is defined as W L ( a ) = 2 if b 0 and d 0 , W L ( a ) = 0 if b = 0 and d = 0 , and W L ( a ) = 1 if either b = 0 or d = 0 . Then the Lee weights of elements in 15 are as follows,

W L ( 0 ) = 0 ; W L ( 1 ) = 2 ; W L ( 2 ) = 2 ; W L ( 3 ) = 1 ; W L ( 4 ) = 2 ;

W L ( 5 ) = 1 ; W L ( 6 ) = 1 ; W L ( 7 ) = 2 ; W L ( 8 ) = 2 ; W L ( 9 ) = 1 ;

W L ( 1 0 ) = 1 ; W L ( 11 ) = 2 ; W L ( 12 ) = 1 ; W L ( 13 ) = 2 ; W L ( 14 ) = 2 .

3. Linear Codes over the Ring 1 5

A linear code C over the ring 15 is a additive sub-module. For every code word x = ( x 1 , x 2 , , x n ) and y = ( y 1 , y 2 , , y n ) in C, the inner product of x and y is defined as x , y = x 1 y 1 + x 2 y 2 + + x n y n . x is orthogonal to y if x , y = 0 .

Let C be a linear code over the ring 15 with length n. The dual code of C is C = { x 15 n | x y = 0 , forevery y C } . Thus, C is also a linear code over the ring 15 with length n. For a codeword x C , the Lee weight of x is defined as W L ( x ) = i = 1 n W L ( x i ) . For every two code words x , y C , the Lee distance between x and y is d L ( x , y ) = W L ( x y ) . The Hamming weight of x is W H ( x ) = | { x i | x i 0 , 1 i n } | , and the Hamming distance between x and y is d H ( x , y ) = W H ( x y ) .

By Chinese Reminder Theory, the generate matrix of the linear code C over the ring 15 is as follows

G = ( I k 1 5 B 1 3 A 1 3 A 1 + 5 B 2 3 A 3 + 5 B 3 0 3 I k 2 0 3 A 4 0 0 0 5 I k 3 0 5 B 4 ) ,

in which the elements of A i and B i belongs to 15 . Thus, C is a Abel Group of type 15 k 1 5 k 2 3 k 3 , and | C | = 15 k 1 5 k 2 3 k 3 .

Let H be the generate matrix of the dual code C . Then G H T = 0 , in which H T is the rotate matrix of H. Since C is a Abel Group of type 15 k 1 5 k 2 3 k 3 , H is a Abel Group of type 15 n ( k 1 k 2 k 3 ) 5 k 3 3 k 2 . Let

H = ( M 1 M 2 M 3 I n ( k 1 + k 2 + k 3 ) Q 1 0 3 I k 3 0 Q 2 5 I k 2 0 0 )

By the linear transformation, M 2 and M 3 have can be changed to be the form as

H = ( P 1 0 5 R 2 0 I n ( k 1 + k 2 + k 3 + k 4 ) P 2 3 R 1 0 I k 4 0 Q 1 0 3 I k 3 0 0 Q 2 5 I k 2 0 0 0 )

According to G H T = 0 , we have

H = ( 12 A 3 T + 10 B 3 T 0 5 B 4 T 0 I n ( k 1 + k 2 + k 3 + k 4 ) 12 A 2 T + 10 B 2 T 3 A 4 T 0 I k 4 0 6 A 1 T 0 3 I k 3 0 0 5 B 1 T 5 I k 2 0 0 0 )

For every x = ( x 1 , x 2 , , x n ) 15 n , let x = c ( x ) 3 + d ( x ) 5 , in which c ( x ) = ( c 1 , c 2 , , c n ) , d ( x ) = ( d 1 , d 2 , , d n ) and x i = c i 3 + d i 5 ( c i I ( 3 ) and d i I ( 5 ) ) for 1 i n . The Gray mapping from 15 n to 15 2 n is

Φ ( c ( x ) 3 + d ( x ) 5 ) = ( c ( x ) , d (x) )

It’s obvious that the Gray map is a distance preserved mapping from ( 15 n , Lee weight) to ( 15 2 n , Hamming weight).

4. Main Results

Theorem 1. For every x , y 15 n , we have

W L ( x ) = W H ( Φ ( x ) ) , d L ( x , y ) = d H ( Φ ( x ) , Φ ( y ) ) .

Therefore, the minimal Lee weight of C is equal to the minimal Hamming weight of Φ ( C ) .

Proof: For x = ( x 1 , x 2 , , x n ) , let x i = c i 3 + d i 5 ( 1 i n ) , in which c i I ( 3 ) and d i I ( 5 ) . By the definition of Lee weight and Gray mapping, we have

W L ( x i ) = W H ( Φ ( x i ) ) = W H ( c i , d i ) ,

Since Φ ( x ) = Φ ( c ( x ) 3 + d ( x ) 5 ) = ( c ( x ) , d ( x ) ) , we have

W H ( Φ ( x ) ) = W H ( c ( x ) , d ( x ) ) = W H ( c ( x ) ) + W H ( d ( x ) ) = i = 1 n W H ( c i ) + i = 1 n W H ( d i ) = i = 1 n W H ( c i , d i ) = i = 1 n W L ( x i ) = W L (x)

and

d L ( x , y ) = W L ( x y ) = W H ( Φ ( x y ) ) = W H ( Φ ( x ) Φ ( y ) ) = d H ( Φ ( x ) , Φ (y) )

Thus we get the conclusion. □

Theorem 2. Let C be a linear code over the ring 15 with length n and d is the minimum distance over C. Then Φ ( C ) is a line of code with the Parameter [ 2 n , k 1 + k 2 + k 3 , d ] .

Proof: For every x , y 15 n and t 1 , t 2 15 , let x = c ( x ) 3 + d ( x ) 5 , y = c ( y ) 3 + d ( y ) 5 . By the definition of gray mapping, we have

Φ ( t 1 x + t 2 y ) = Φ ( [ t 1 c ( x ) + t 2 c ( y ) ] 3 + [ t 1 d ( x ) + t 2 d ( y ) ] 5 ) = ( t 1 c ( x ) + t 2 c ( y ) , t 1 d ( x ) + t 2 d ( y ) ) = ( t 1 c ( x ) , t 1 d ( x ) ) + ( t 2 c ( y ) , t 2 d ( y ) ) = t 1 ( c ( x ) , d ( x ) ) + t 2 ( c ( y ) , d ( y ) ) = t 1 Φ ( x ) + t 2 Φ ( y ) .

Thus Φ ( C ) is linear. Since | C | = 15 k 1 5 k 2 3 k 3 , Φ ( C ) is a linear code with the parameter [ 2 n , k 1 + k 2 + k 3 , d ] . □

The property of Theorem 2 also applies to the rings which can be decomposed into direct sum of two ideals.

5. Conclusion

By theoretical analysis and derivation, we prove that the minimum Lee weight of a linear code over the ring 15 is equal to the minimum Hamming weight of its Gray mapping. Furthermore, the linear property of its Gray mapping is confirmed. In this paper, we have done some preliminary research work, but there are also many other research contents about linear codes over the ring 15 to be considered, such as weight enumerators, Mac Williams identities and the self-dual codes over the ring 15 .

Acknowledgements

This research is supported by Foundation of Langfang Normal University (LSLB201707), Scientific Research Innovation Team of Langfang Normal University (Rings and Algebras with their applications on Error correcting theory), the Key Programs of Scientific Research Foundation of Hebei Educational Committee (Grant No.ZD2019056) and the Key Foundation of Hebei Education Department (ZD2017064).

Cite this paper: Li, W. , Wan, L. , Yue, M. , Chen, W. and Zhang, X. (2020) Linear Codes over the Finite Ring Z15. Advances in Linear Algebra & Matrix Theory, 10, 1-5. doi: 10.4236/alamt.2020.101001.
References

[1]   Hammons, A.R., Kumar, P.V., Calderbank, A.R., Sloane, N.J.A. and Solé, P. (1994) The Z4-Linearity of Kerdock, Preparata, Goethals and Related Codes. IEEE Transactions on Information Theory, 40, 301-319.
https://doi.org/10.1109/18.312154

[2]   Dougherty, S.T., Gulliver, T.A. and Wong, J. (2006) Self-Dual Codes over Z8 and Z9. Des. Codes Crypt. Designs, Codes and Cryptography, 41, 235-249.
https://doi.org/10.1007/s10623-006-9000-2

[3]   Li, P., Guo, X.M., Zhu, S.X. and Kai, X.S. (2017) Some Results on Linear Codes over the Ring Z4+u Z4+vZ4+uvZ4. Journal of Computational and Applied Mathematics, 54, 307-324.
https://doi.org/10.1007/s12190-016-1011-1

[4]   Liu, X.S. and Liu, H.L. (2015) Macwilliams Identities of Linear Codes over the Ring F2+uF2+vF2. Journal of Systems Science and Complexity, 28, 691-701.
https://doi.org/10.1007/s11424-015-2246-x

[5]   Shi, M.J., Sole, P. and Wu, B. (2013) Cyclic Codes and the Weight Enumerator of Linear Codes over F2+vF2+v2F2. Applied Mathematics and Computation, 2, 247-255.

[6]   Yu, H. and Zhu, S.X. (2006) Identities of Linear Codes and Their Codes over F2+uF2. Journal of University of Science and Technology of Chain, 12, 1285-1288.

[7]   Nechaev, A.A. (1991) Kerdock Codes in a Cyclic Form. Discrete Applied Mathematics, 1, 365-384.
https://doi.org/10.1515/dma.1991.1.4.365

[8]   Constantinescu, I. and Heise, W. (1997) A Metric for Codes over Residue Class Rings of Integers. Problemy Peredachi Informatsii, 33, 22-28.

 
 
Top