• No results found

ON GRAY IMAGES OF CONSTACYCLIC CODES OVER THE FINITE RING F2 + u1 F2 + u2 F2

N/A
N/A
Protected

Academic year: 2020

Share "ON GRAY IMAGES OF CONSTACYCLIC CODES OVER THE FINITE RING F2 + u1 F2 + u2 F2"

Copied!
6
0
0

Loading.... (view fulltext now)

Full text

(1)

ON GRAY IMAGES OF CONSTACYCLIC CODES OVER THE FINITE RING F2+u1F2+u2F2

MUSTAFA ¨OZKAN1, ABDULLAH DERTLI2, YASEMIN CENGELLENMIS1,§

Abstract. We introduce the finite ringF2+u1F2+u2F2,u12=u1 , u22= 0, u1.u2= u2.u1= 0 which is not a finite chain ring. We focus on (1 +u2) -constacyclic codes over F2+u1F2+u2F2 of odd length. We prove that the Gray image of a linear (1 +u2)

-constacyclic code overF2+u1F2+u2F2 of odd lengthnis a quasi-cyclic code of index

4 and length 4noverF2.

Keywords: Constacylic code, Gray image.

AMS Subject Classification: 94B15

1. Introduction

In [6], Wolfman showed that the Gray image of a linear negacyclic code over Z4 of

lengthn is distance invariant (not necessarily linear) cyclic code. It was shown that, for oddn, the Gray image of a linear cyclic code over Z4 of lengthnis equivalent to a binary

cyclic code. In 2006, J.F. Qian et al. introduced linear (1 +u)-constacyclic codes and cyclic codes over F2 +uF2 and characterized codes over F2 which are the Gray images

of (1 +u)-constacyclic codes or cyclic codes over F2+uF2 in [4]. In [1] , they extended

the result of [4] to codes over the commutative ringFpk +uFpk where p is a prime,k∈N and u2 = 0 , In [5], it was introduced (1 +u2) -constacyclic codes or cyclic codes over

F2+uF2+u2F2, u3 = 0 and characterized codes over F2 which are the Gray images of

(1 +u2) -constacyclic or cyclic codes over F2 +uF2 +u2F2. In [2], it was introduced

(1−um)-constacyclic codes overF2+uF2+...+umF2 , um+1 = 0 and characterized codes

overF2. In 2011, (1+v)-constacyclic codes overF2+uF2+vF2+uvF2were studied. (1+v)

-constacyclic codes overF2+uF2+vF2+uvF2, u2= v2= 0, u.v−v.u= 0 of odd length

were characterized with the help of cyclic codes overF2+uF2+vF2+uvF2. A new Gray

map was defined. It was shown that the image under the Gray map of (1 +v)-constacyclic codes overF2+uF2+vF2+uvF2 are cyclic codes overF2+uF2in [3]. In 2013, X. Xiaofang

1 Department of Mathematics, Trakya University, Edirne, Turkey.

e-mail: mustafaozkan22@icloud.com, mustafaozkan@trakya.edu.tr. ORCID: https://orcid.org/0000-0001-7398-8564.

2 Department of Mathematics, Ondokuz Mayis University, Samsun, Turkey.

e-mail: abdullah.dertli@gmail.com; ORCID: https://orcid.org/0000-0001-8687-032X.

1 Department of Mathematics, Trakya University, Edirne, Turkey.

e-mail: ycengellenmis@yahoo.com; ORCID: https://orcid.org/0000-0002-8133-9836. § Manuscript received: August 30, 2017; accepted: May 10, 2018.

TWMS Journal of Applied and Engineering Mathematics, Vol.9, No.4 cI¸sık University, Department of Mathematics, 2019; all rights reserved.

(2)

studied (1+v)-constacyclic codes over the ringF2+uF2+vF2,u2 = v2 = 0, u.v=v.u= 0,

(1 +v)-constacyclic codes over F2+uF2+vF2 of odd length are characterized with the

help of cyclic codes overF2+uF2+vF2 in [7].

This paper is organized as follows. In section 2, we give some knowledge about the ring

R = F2 +u1F2 +u2F2 , u12 = u1 , u22 = 0, u1.u2 = u2.u1 = 0 and the codes over R .

In section 3, we have the relationship between cyclic code over and (1 +u2)-constacyclic

code over R . In section 4, the Gray image of (1 +u2)-constacyclic code over R of odd length is obtained.

2. Preliminaries

The ring R = F2 +u1F2 + u2F2 is defined as a chacteristic 2 ring subject to the

restrictionsu12=u1 , u22 = 0, u1.u2 =u2.u1= 0. The isomorphismF2+u1F2+u2F2 ∼= F2[u1, u2]/ < u21 = u1, u22 = 0, u1u2 =u2u1 = 0 > is obvious to see. The elements of R

may be written as 0,1, u1, u2,1+u1,1+u2, u1+u2,1+u1+u2. Addition and multiplication

operations overR are given in the following tables :

Table 1

⊕ 0 1 u1 u2 1 +u1 1 +u2 u1+u2 1 +u1+u2

0 0 1 u1 u2 1 +u1 1 +u2 u1+u2 1 +u1+u2

1 1 0 1 +u1 1 +u2 u1 u2 1 +u1+u2 u1+u2

u1 u1 1 +u1 0 u1+u2 1 1 +u1+u2 u2 1 +u2

u2 u2 1 +u2 u1+u2 0 1 +u1+u2 1 u1 1 +u1

1 +u1 1 +u1 u1 1 1 +u1+u2 0 u1+u2 1 +u2 u2

1 +u2 1 +u2 u2 1 +u1+u2 1 u1+u2 0 1 +u1 u1

u1+u2 u1+u2 1 +u1+u2 u2 u1 1 +u2 1 +u1 0 1

1 +u1+u2 1 +u1+u2 u1+u2 1 +u2 1 +u1 u2 u1 1 0

Table 2

⊗ 0 1 u1 u2 1 +u1 1 +u2 u1+u2 1 +u1+u2

0 0 0 0 0 0 0 0 0

1 0 1 u1 u2 1 +u1 1 +u2 u1+u2 1 +u1+u2

u1 0 u1 u1 0 0 u1 u1 0

u2 0 u2 0 0 u2 u2 0 u2

1 +u1 0 1 +u1 0 u2 1 +u1 1 +u1+u2 u2 1 +u1+u2

1 +u2 0 1 +u2 u1 u2 1 +u1+u2 1 u1+u2 1 +u1

u1+u2 0 u1+u2 u1 0 u2 u1+u2 u1 u2

1 +u1+u2 0 1 +u1+u2 0 u2 1 +u1+u2 1 +u1 u2 1 +u1

The units of R can be found to be followingR∗ ={1,1 +u2} . It can be easily find all the ideals ofR to be listed as,

{0}=I0 ⊂ Iu1 ⊂Iu1+u2 ⊂R=I1+u2 {0}=I0 ⊂ Iu2 ⊂I1+u1 =I1+u1+u2 ⊂R=I1+u2

(3)

R2 =F2+u2F2,u22 = 0 . The elements ofR2 may be written as 0,1, u2,1 +u2 where 1

and 1 +u2 are only units in R2. R2 has three ideals (0),(1) and (u2).

A linear code C over R(or R2 ) of length n is a R (or R2 ) submodule of Rn (or

R2n). A linear code C over F2 of length n is a F2 subvector space F2n. An element of C is called a codeword . Each codeword c in such a code C is an n-tuple of the form

c= (co, c1, ..., cn−1)∈Rn ( or R2n ,Fn2 ) and can be represented by c= (c0, c1, ..., cn−1) ←→ c(x) =

n−1

P

i=0

cixi∈R[x] (or R2[x] ,F2[x] ).

The Gray map Φ1 on R is given by

Φ1 : R−→R22

a+u1b+u2c7→ Φ1(a+u1b+u2c) = Φ1(r+u1q) = (u2.r, q)

where r = a+u2c and q = b+u2c. We will extend Φ1 to Rn naturally as follows

Φ1(c0, c1, ..., cn−1) = (u2.r0, u2.r1, ..., u2.rn−1, q0, q1, ..., qn−1) where ci = ri+u2.qi for all

i= 0,1, ..., n−1.

The Gray map Φ2 on R2 is given by

Φ2 : R2−→F22 s+u2t 7→ (s, t)

wheres, t∈F2. We will extend Φ2 toRn2 naturally as follows

Φ2 : Rn2 −→F22n

(c0, ..., cn−1)7→(s0, ..., sn−1, t0, ...., tn−1)

whereci =si+u2.ti ,si, ti ∈F2 for alli= 0,1, ..., n−1.

The weight w1(r) ofr ∈R is given by

w1(r) =

        

0 ; r = 0

1 ; r= 1, u1, u2

2 ; r= 1 +u1,1 +u2, u1+u2

3 ; r= 1 +u1+u2

This extends to a weight function in Rn. If r = (r0, r1, ..., rn−1) ∈ Rn then w1(r)

= n−1

P

i=0

w1(ri) . The distance d1(x, y) between any distinct vectors x, y ∈Rn is defined to

bew1(x−y) . Thed1 minimum distance ofC is defined asd1(C) = min{d1(x, y)}for any

x, y ∈ C , x6=y .

The weight w2(t) oft∈R2 is given by

w2(t) =   

 

0 ; t= 0 1 ; t= 1, u2

2 ; t= 1 +u2

This extends to a weight function in Rn

2 . If t = (to, t1, ..., tn−1) ∈ Rn2 then w2(t)=

n−1

P

i=0

w2(ti). The distance d2(x, y) between any distinct vectors x, y∈ Rn2 is defined to be w2(x−y) . Thed2 minimum distance of C is defined as d2(C) = min{d2(x, y)} for any x, y ∈ C , x6=y.

Let C be a code over F2 of length n and let c = (c0, c1, ..., cn−1) be a codeword of C.

The Hamming weight ofC is defined as

wH(c)= n−1

P

i=0

(4)

wherewH(ci) = 1 ifci= 1 andwH(ci) = 0 ifci= 0 . The minimum Hamming distance ofC is defined asdH = min{dH(c, c0)} for any c, c0 ∈C, c6=c0.

Φ1 and Φ2 are distance preserving map from (Rn, d1) to (R22n, d2) and (R22n, d2) to

(F42n, dH), respectively.

Expressing elements of R asa+u1b+u2c=r+u1q wherer=a+u2c andq =b+u2c

are both inR2, we see that

w1(a+u1b+u2c) =w1(r+u1q) =w2(u2r, q) =wH(0, b, a, c) A cyclic shift on Rn is a permutation σ such that

σ(c0, c1, ..., cn−1) = (cn−1, c0, ..., cn−2)

A linear code C overRof length nis said to be cyclic code if it is invariant under the cyclic shiftσ(C) =C.

A (1 +u2)-constacyclic shift γ act onRn as

γ(c0, c1, ..., cn−1) = ((1 +u2)cn−1, c0, ..., cn−2)

A linear code C over R of length n is said to be (1 +u2)-constacyclic code if it is invariant under the (1 +u2)-constacyclic shiftγ(C) =C.

Let C be a code of lengthn overR and P(C) be its polynomial representation,

P(C) = (n1

X

i=0

rixi : (r0, r1, ..., rn−1)∈C

)

A code C of length noverR is cyclic if and only ifP(C) is an ideal of R[x]/hxn−1i. A code C of length nover R is (1 +u2)-constacyclic if and only if P(C) is an ideal of

R[x]/hxn−(1 +u2)i

Let a∈R22n with a= (a0, a1, ..., a2n−1) = (a(0)|a(1)),a(i) ∈R2n for all i= 0,1. Let σ⊗2

be the map fromR22n toR22n given by

σ⊗2(a) =σ(a(0))|σ(a(1))

whereσ is the usual cyclic shift. A code ˆC of length 2noverR2 is said to be quasi-cyclic code of index 2 ofσ⊗2( ˆC) = ˆC.

Let a ∈ F42n with a = (a0, a1, ..., a4n−1) = (a(0)|a(1)|a(2)|a(3)), a(i) ∈ Fn2 for all i= 0,1,2,3. Let σ⊗4 be the map from F42n toF42n given by

σ⊗4(a) =

σ(a(0))|σ(a(1))|σ(a(2))|σ(a(3))

whereσ is the usual cyclic shift. A code ˆC of length 4noverF2 is said to be quasi-cyclic

code of index 4 ofσ⊗4( ˆC) = ˆC.

3. The relationship between Cyclic Codes Over R and (1 +u2)-Constacyclic

Codes Over R

Suppose nis odd. Let

µ : R[x]/hxn−1i −→R[x]/hxn−(1 +u2)i

r(x) 7−→ r((1 +u2)x)

(5)

If µis given as follows,

µ : Rn−→Rn

r = (r0, ..., rn−1) = (r0,(1 +u2)r1...,(1 +u2)n−1rn−1)

then we have,

Proposition 3.1. A codeC of length nover R is cyclic code if and only ifµ(C) is linear

(1 +u2)-constacyclic code.

4. (1 +u2)-Constacyclic Codes Over R of Odd Length and Their Images

Firstly, we obtained even length quasi-cyclic codes of index 2 over R2 as the Φ1 Gray

images of (1 +u2)-constacyclic codes over R, later we obtained the Φ2 Gray image of

quasi-cyclic code of index 2 overR2 with length even. Proposition 4.1. σ⊗2Φ1= Φ1γ

Proof. Let c = (c0, c1, ..., cn−1) ∈ Rn where ci = ri +u1qi for i = 0,1, ..., n −1. If Φ1(c0, c1, ..., cn−1) = Φ1(r0+u1q0, r1+u1q1, ..., rn−1+u1qn−1) = (u2r0, u2r1, ..., u2rn−1, q0, ..., qn−1)

thenσ⊗2Φ1(c) = (u2rn−1, u2r0, ..., u2rn−2, qn−1, q0, ..., qn−2).

On the other hand γ(c0, ..., cn−1) = ((1 +u2)cn−1, c0, ..., cn−2) where (1 +u2)cn−1 = rn−1+u2rn−1+u1qn−1. Then Φ1(γ(c)) = Φ1((rn−1+u2rn−1) +u1qn−1, r0+u1q0, ..., rn−2+ u1qn−2) = (u2rn−1, u2r0, ..., u2rn−2, qn−1, q0, ..., qn−2).

Theorem 4.1. A code C of length n over R is (1 +u2)-constacyclic code if and only if

Φ1(C) is quasi-cyclic code of index 2 and length 2n over R2.

Proof. SupposeC is (1 +u2)-constacyclic code, thenγ(C) =C. By applying Φ1, we have

Φ1(γ(C)) = Φ1(C). By using the Proposition 4.1 , we have σ⊗2(Φ1(C)) = Φ1(γ(C)) =

Φ1(C). So Φ1(C) is quasi-cyclic code of index 2. Conversely, if Φ1(C) is quasi-cyclic

code of index 2, then σ⊗2(Φ1(C)) = Φ1(C). By using the Proposition 4.1, we have σ⊗2(Φ1(C)) = Φ1(γ(C)) = Φ1(C). Since Φ1 is injective it follows thatγ(C) =C.

Now, we will obtain the Φ2 Gray image of even length quasi-cyclic code of index 2 over R2.

Proposition 4.2. σ⊗4Φ2= Φ2σ⊗2

Proof. It is proved as in the proof of the Proposition 4.1.

Theorem 4.2. A code B length 2nover R2 is quasi-cyclic code of index 2 if and only if

Φ2(B) is quasi-cyclic code of index 4 over F2 with length4n.

Proof. It is proved as in the proof of the Theorem 4.1. .

Corollary

A code C odd length n over R is (1 +u2)-constacyclic if and only if Φ2(Φ1(C)) is

quasi-cyclic code of index 4 and length 4noverF2.

5. conclusion

It is introduced that the finite ring F2+u1F2+u2F2,u21=u1, u22= 0, u1u2 =u2u1= 0.

(6)

References

[1] M. C. Amarra, F. R. Nemenzo, (2008), On (1−u)-cyclic codes overFpk+uFpk, Applied Mathematics

Letters, 21, pp. 1129-1133.

[2] Y. Cengellenmis, (2009), On (1 +um)-cyclic codes overF2+uF2+...+umF2 , Int J.Contemp. Math

Sciences, 20 (4), pp. 987-992.

[3] S. Karadeniz, B. Yldz, (2011), On (1−v)-constacyclic codes overF2+uF2+vF2+uvF2, Journal of

the Franklin Institude , 348, pp. 2625-2632.

[4] J.F. Qian, L. N. Zhang, S. X. Zhu, (2006), ( (1 +u)-constacyclic and cyclic codes over F2+uF2 ,

Applied Mathematics Letters 19, pp. 820-823.

[5] J. F. Qian, L. N. Zhang, S. X. Zhu, (2006), Constacyclic and cyclic codes over F2+uF2+ u2F2 ,

IEICE Trans.Fundamentals, 89-a (6), pp. 1863-1865.

[6] J.Wolfmann, (1999), Negacyclic and cyclic codes overZ4, IEEE Trans. Inf. Theory, 45, pp. 2527-2532.

[7] Xu Xioafang, (2013), (1+v)-constacyclic codes over F2+uF2 + vF2 , Computer Engineering and

Applications, 49 (12), pp. 77-79.

Mustafa ¨Ozkanis a doctor in the Department of Mathematics at Trakya University in Turkey. He received his PhD degree in 2016 from mathematics at Trakya Univer-sity. He has given talks at international conferences. His research interest is algebraic coding theory.

Abdullah Dertliis a research assistant doctor in the Department of Mathematics, Ondokuz Mays University, Samsun, Turkey. He received his B.Sc. and M.Sc. in Mathematics from Trakya University of Turkey. He received his Ph.D. in mathematics from Ondokuz Mays University of Turkey. His research interests include algebra and coding theory.

Figure

Table 2

References

Related documents

Non-linear bipolar resistive switching characteristics have been simulated using space-charge limited current (SCLC) conduction at low voltage, F-N tunneling at higher voltage

The results of the present study showed that significant gender dimorphism in tooth dimensions was found to be prevalent in all teeth in Angle’s Class III malocclusion

The primary data used in this study were compiled manually by the author from media reports of the campaign trails of Prime Minister Kevin Rudd (leader of the Australian Labor

(See also Craig (2012) and Islamic contract types - Islamic Finance: www.islamic-finance.com/item13_f.htm).. 7 incomes and may shy away from going in to have a residence of their

This graph is used to both keep track of the dialog state and to select the best example using multiple recognition hypotheses for augmenting previous EBDM framework.. 3

This study indicated that there was no significant association between ApaI polymorphism and bone density rate in lumar vertebrae and femoral neck; TaqI and

The general idea of exploiting frequency corre- lations to acquire word translations from compara- ble corpora has been explored in several previous studies (e.g., (Fung, 1995;

The main purpose of this paper is to provide a comprehensive study on the TQM critical success factors (CSFs) from existing literature, and likewise evaluate different TQM models that