This paper investigates the structure, enumeration, and duality of $(1+pw)$-constacyclic codes over a non-principal ideal ring, providing new insights into their properties and self-dual variants, especially over rings with characteristic 2.
Contribution
It characterizes the structure, counts, and dual codes of $(1+pw)$-constacyclic codes over $Z_{p^s}+uZ_{p^s}$, including self-dual codes over rings with characteristic 2.
Findings
01
Explicit structure of these constacyclic codes is provided.
02
Formulas for counting the number of codes and codewords are derived.
03
Self-dual codes over rings with characteristic 2 are characterized.
Abstract
(1+pw)-constacyclic codes of arbitrary length over the non-principal ideal ring Zpsβ+uZpsβ are studied, where p is a prime, wβZpsΓβ and s an integer satisfying sβ₯2. First, the structure of any (1+pw)-constacyclic code over Zpsβ+uZpsβ are presented. Then enumerations for the number of all codes and the number of codewords in each code, and the structure of dual codes for these codes are given, respectively. Then self-dual (1+2w)-constacyclic codes over Z2sβ+uZ2sβ are investigated, where w=2sβ2β1 or 2sβ1β1 if sβ₯3, and w=1 if s=2.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography Β· graph theory and CDMA systems Β· Finite Group Theory Research
Full text
On a class of constacyclic codes over the non-principal ideal ring Zpsβ+uZpsβ
Yuan Cao
School of Sciences, Shandong University of
Technology, Zibo, Shandong 255091, China
(1+pw)-constacyclic codes of arbitrary length over the non-principal ideal ring Zpsβ+uZpsβ
are studied, where p is a prime, wβZpsΓβ and s an integer satisfying sβ₯2. First,
the structure of any (1+pw)-constacyclic code over Zpsβ+uZpsβ are presented. Then enumerations for the number of all codes and the number of codewords in each code, and the structure of dual codes for
these codes are given, respectively. Then self-dual (1+2w)-constacyclic codes over Z2sβ+uZ2sβ
are investigated, where w=2sβ2β1 or 2sβ1β1 if sβ₯3, and w=1 if s=2.
Algebraic coding theory deals with the design of error-correcting and error-detecting codes for the reliable transmission
of information across noisy channel.
The class of constacyclic codes play a very significant role in
the theory of error-correcting codes. The most impotent classes of
these codes are that of cyclic codes and negacyclic codes, which have been well studied
since the late 1950s. Since 1999, special classes of constacyclic
codes over certain classes of finite commutative chain rings have been studied
by numerous authors. See [1-17], for example.
For any positive integer N, let
AN={(a0β,a1β,β¦,aNβ1β)β£aiββA,Β 0β€iβ€Nβ1} which is an A-module with componentwise addition and scalar multiplication by elements of A. Then an A-submodule C of AN is called a linear code over A of length N.
For any vectors a=(a0β,a1β,β¦,aNβ1β),b=(b0β,b1β,β¦,bNβ1β)βAN.
The usual Euclidian inner product of a and b is defined by
[a,b]Eβ=βj=0Nβ1βajβbjββA.
Then [β,β]Eβ is a symmetric and non-degenerate bilinear form on the A-module
AN. Let C be a linear code over A of length N. The Euclidian dual code
of C is defined by Cβ₯Eβ={aβANβ£[a,b]Eβ=0,Β βbβC}, and C is said to be self-dual if C=Cβ₯Eβ.
Recent years, codes over finite non-principal ideal commutative rings have been studied by many authors.
For example, in Yildiz et al [18],
MacWilliams identities, projections, and formally self-dual codes for linear codes over the ring Z4β+uZ4β and their application to real and complex lattices have been studied.
for any Ξ±=a+bu,Ξ²=c+duβZpsβ+uZpsβ with a,b,c,dβZpsβ.
For any fixed wβZpsΓβ,
the following questions
have not been investigated completely for (1+pw)-constacyclic codes over Zpsβ+uZpsβ of arbitrary length
to the best of our knowledge:
(Q-1) Present precisely all distinct (1+pw)-constacyclic codes over Zpsβ+uZpsβ of arbitrary length N, and count the number of these codes.
(Q-2) For each code C presented above, determine the number of codewords contained in C and
give the dual code of C precisely.
(Q-3) Determine the self-duality for (1+pw)-constacyclic codes over Zpsβ+uZpsβ.
where we regard Fpβ as a subset of Zpsβ (but Fpβ is not a subring of Zpsβ). It is well known that aβZpsΓβ
if and only if a0βξ =0.
Denote a=a0ββFpβ. Then
β:aβ¦a (βaβZpsβ) is a ring homomorphism from
Zpsβ onto Fpβ, and this homomorphism can be extended to a ring homomorphism from
Zpsβ[y] onto Fpβ[y] by fβ(y)=βi=0mβbiβyi
for any f(y)=βi=0mβbiβyiβZpsβ[y].
A monic polynomial f(y)βZpsβ[y]
of positive degree is said to be basic irreducible if fβ(y) is an irreducible
polynomial in Fpβ[y] ([16] Chapter 13, Page 328).
Lemma 2.6Let wβZpsΓβ. Then ord(1+pw)=pv for some positive integer v, and there exists a unique w0ββZpsΓβ
modulo psβ1 such that (1+pw0β)n=1+pw.
Proof It is known that 1+pZpsβ is a multiplicative subgroup of ZpsΓβ
with order psβ1 (cf. [16] Corollary 14.12]). Hence ord(1+pw)=pv for some positive integer v. Since gcd(n,p)=1, the mapping 1+paβ¦(1+pa)n (βaβZpsβ)
is an automorphism of the multiplicative group 1+pZpsβ. Hence there is a unique
element w0ββZpsβ modulo psβ1 such that (1+pw0β)n=1+pw.
As every element of Zpsβ has a unique
p-expansion, there is a unique integer k, 0β€kβ€sβ1, such that w0β=pkb for some bβZpsΓβ.
Suppose that kβ₯1, then 1+pw0β=1+pk+1b, which implies (1+pw0β)n=1+pk+1bn+p2(k+1)c=1+p(pkbn+p2k+1c) for some cβZpsβ.
From this and by (1+pw0β)n=1+pw we deduce pw=p(pkbn+p2k+1c), i.e., w=pkbn+p2k+1c+psβ1e for some eβZpsβ,
and hence ws=0, which contradicts that wβZpsΓβ. Therefore, we conclude that k=0 and hence
w0β=bβZpsΓβ.
β‘
In the rest of this paper, we adopt the following notations.
Notation 2.7 Let w,w0ββZpsΓβ satisfying (1+pw0β)n=1+pw, and assume
[TABLE]
where f1β(y),β¦,frβ(y) are pairwise coprime monic basic irreducible polynomials
in Zpsβ[y]. For each i, 1β€iβ€r, assume deg(fiβ(y))=diβ and denote
Let 1β€iβ€r and denote Fiβ(y)=fiβ(y)ynβ1ββZpsβ[y].
Since Fiβ(y) and fiβ(y) are coprime, there are polynomials aiβ(y),biβ(y)βZpsβ[y]
such that
[TABLE]
Substituting xpk(1+pw0β)β1=1+pw0βxpkβ for y in (2.3) and (2.4), by (1+pw0β)n=1+pw we obtain
[TABLE]
and
aiβ(1+pw0βxpkβ)Fiβ(1+pw0βxpkβ)+biβ(1+pw0βxpkβ)fiβ(1+pw0βxpkβ)=1
in the ring Zpsβ[x], respectively. It is clear that
deg(fiβ(xpk(1+pw0β)β1))=pkdiβ for i=1,β¦,r.
In the rest of this paper, we set
[TABLE]
(mod xpknβ(1+pw)). Then from Chinese Remainder Theorem for commutative rings with identity, we deduce that following theorem.
(i) ΞΈ1β(x)+β¦+ΞΈrβ(x)=1, ΞΈiβ(x)2=ΞΈiβ(x)
and ΞΈiβ(x)ΞΈjβ(x)=0 in A for all 1β€iξ =jβ€r.
(ii) A=A1βββ¦βArβ, where Aiβ=ΞΈiβ(x)A and its multiplicative
identity is ΞΈiβ(x). Moreover, this decomposition is a direct sum of rings
in that AiβAjβ={0} for all i and j, 1β€iξ =jβ€r.
In order to present all (1+pw)-constacyclic codes over Zpsβ+uZpsβ of length pkn, by Lemma 3.2
it is sufficient to give all ideals of
the ring Riβ+uRiβ for all i=1,β¦,r. Now, we give the following theorem.
Then all distinct
ideals Ciβ of Riβ+uRiβ are given by the following table:
[TABLE]
where
[TABLE]
if pks is even;
[TABLE]
if pks is odd, and Ξ¨(pdiβ,pks) can be calculated by the following recurrence formula:
Ξ¨(pdiβ,t)=0* for t=1,2,3, Ξ¨(pdiβ,t)=1 for t=4*;
Ξ¨(pdiβ,t)=Ξ¨(pdiβ,tβ1)+βj=1β2tβββ1β(tβ2jβ1)pdiβ(jβ1)* for tβ₯5*.
Therefore, the number of all
distinct ideals of the ring Riβ+uRiβ is equal to
[TABLE]
Proof We define a map Ο±:Riβ+uRiββRiβ by
Ο±(Ξ±+uΞ²)=Ξ± (βΞ±,Ξ²βRiβ). Then Ο± is a surjective ring
homomorphism from Riβ+uRiβ onto Riβ.
Let J be an ideal of Riβ+uRiβ and Ο±β£Jβ be the restriction of Ο± to J.
Then Ο±β£Jβ is a surjective ring homomorphism from J onto Ο±(J)={Ο±(ΞΎ)β£ΞΎβJ},
which implies Ο±(J)β J/Ker(Ο±β£Jβ) where
Ker(Ο±β£Jβ)={ΞΎβJβ£Ο±(ΞΎ)=0} is the kernel of Ο±β£Jβ. Therefore,
β£Jβ£=β£Ο±(J)β£β£Ker(Ο±β£Jβ)β£.
Let (J:u)={ΞΎβRiβ+uRiββ£uΞΎβJ}. Then (J:u) is an ideal of Riβ+uRiβ
satisfying Jβ(J:u). Since Ο± is a surjective ring
homomorphism, we see that Ο±(J) and Ο±(J:u) are ideals of Riβ
satisfying Ο±(J)βΟ±(J:u). As Riβ is a finite chain ring described in Section 2,
there is a unique pair (liβ,miβ) of integers, 0β€miββ€liββ€pks, such that
[TABLE]
By the definition of Ο±, we have
[TABLE]
which implies β£Ker(Ο±β£Jβ)β£=β£Ο±(J:u)β£. From this, by Equation (3.1) we deduce that β£Jβ£=β£fiβ(x)liβRiββ£β£fiβ(x)miβRiββ£. Then by
Corollary 2.8(iii) we have
Since every element of Riβ has a unique fiβ(x)-expansion, by
ufiβ(x)liβ=u(fiβ(x)liβ+uΞ±)βJ we may assume that
Ξ±=0 or Ξ±=fiβ(x)tiβh(x), where 0β€tiβ<liβ and
h(x)=βj=0pksβtiββ1βhjβ(x)fiβ(x)j with h0β(x),β¦,hpksβtiββ1β(x)βTiβ
satisfying h0β(x)ξ =0.
By ufiβ(x)pksβliβ+tiβ=fiβ(x)pksβliβh(x)β1(fiβ(x)liβ+ufiβ(x)tiβh(x))βJ, we see that
fiβ(x)pksβliβ+tiββΟ±(J:u)=fiβ(x)miβRiβ, which implies pksβliβ+tiββ₯miβ. Hence we have one of the following
two cases:
(β’-1) pksβliβ+tiβ=miβ, i.e., miββtiβ=pksβliβ or liβ+miβ=pks+tiβ.
In this case, Ξmiββtiβ(i)β=Ξpksβliβ(i)β. Now, by
Therefore, all distinct ideals of Riβ+uRiβ are given by
(I)β(V) and the number of elements in each ideal is given at the right side of the table.
It is obvious that the numbers of ideals in cases (I), (II) and (IV) are equal to pks+1, pks and 21βpks(pksβ1) respectively. Now, we count the number of ideals in (III) and (V), respectively.
First, we consider ideals in (III).
Let 0β€tiβ<liββ€pksβ1. When liββ€β2pks+1ββ, i.e., 2liββ€pks, then
tiβ satisfies tiββ₯2liββpks for all 0β€tiββ€liββ1. In this case, the number of ideals is equal to
[TABLE]
When liββ₯β2pks+1ββ+1, i.e., 2liβ>pks, then
tiβ satisfies tiββ₯2liββpks for all 2liββpksβ€tiββ€liββ1, and tiβ satisfies tiβ<2liββpks for all 0β€tiββ€2liββpksβ1.
In this case, the number of ideals is equal to
If 1β€pksβ€3, there is no triple (tiβ,miβ,liβ) of integers satisfying 0β€tiβ<miβ<liββ€pksβ1 and liβ+miββ€pks+tiββ1.
In this case, the number of ideals in (V) is equal to [math]. Then we set Ξ¨(pdiβ,pks)=0 for all pksβ€3.
Then from Lemma 3.2 and Theorem 3.3 we deduce the following corollary.
Corollary 3.4Every (1+pw)-constacyclic
code C over Zpsβ+uZpsβ of length pkn can be constructed by the following two steps:
(i) For each i=1,β¦,r, choose an ideal Ciβ of Riβ+uRiβ
listed in Theorem 3.3.
(ii) Set C=βi=1rβΞΈiβ(x)Ciβ=βi=1rβΞΈiβ(x)Ciβ(modΒ xpknβ(1+pw)). Then the codewords in C is
equal to β£Cβ£=βi=1rββ£Ciββ£.
Using the notations of Theorem 3.3, the number of (1+pw)-constacyclic
codes over Zpsβ+uZpsβ of length pkn is equal to βi=1rβNiβ.
Using the notations of Corollary 3.4, C=βi=1rβΞΈiβ(x)Ciβ is called the canonical form decomposition of the (1+pw)-constacyclic
code C over Zpsβ+uZpsβ.
4. Dual Codes of (1+pw)-Constacyclic Codes
In this section, we give the dual code of every (1+pw)-constacyclic code over Zpsβ+uZpsβ
of length N and investigate the self-duality of these codes.
Lemma 4.1Let wβZpsΓβ and denote w=βw(1+pw)β1.
Then wβZpsΓβ and (1+pw)β1=1+pw.
Proof Obviously, we have w=βw(1+pw)β1βZpsΓβ and (1+pw)β1=(1+pwβpw)(1+pw)β1=1+p(w(1+pw)β1).
β‘
Substituting 1+pw0βxpkβ for y in (2.3) and (2.4), we obtain
[TABLE]
and
aiβ(1+pw0βxpkβ)Fiβ(1+pw0βxpkβ)+biβ(1+pw0βxpkβ)fiβ(1+pw0βxpkβ)=1
in the ring Zpsβ[x], respectively. It is clear that
deg(fiβ(xpk(1+pw0β)β1))=pkdiβ for i=1,β¦,r.
In the rest of this paper, we set
[TABLE]
(mod xpknβ(1+pw)). Then by Chinese remainder theorem for commutative rings with identity, paralleling to Theorem 2.9 we have the following
(i) ΞΈ1β(x)+β¦+ΞΈrβ(x)=1, ΞΈiβ(x)2=ΞΈiβ(x)
and ΞΈiβ(x)ΞΈjβ(x)=0 in A for all 1β€iξ =jβ€r.
(ii) A=A1βββ¦βArβ, where Aiβ=ΞΈiβ(x)A and its multiplicative
identity is ΞΈiβ(x). Moreover, this decomposition is a direct sum of rings
in that AiβAjβ={0} for all i and j, 1β€iξ =jβ€r.
Now, let Ξ±=(Ξ±0β,Ξ±1β,β¦,Ξ±Nβ1β),Ξ²=(Ξ²0β,Ξ²1β,β¦,Ξ²Nβ1β)β(Zpsβ+uZpsβ)N,
where N=pks and Ξ±jβ,Ξ²jββZpsβ+uZpsβ for all j=0,1β¦,Nβ1. In the rest of this paper,
we denote
[TABLE]
[TABLE]
Recall that
the usual Euclidian inner product of Ξ± and Ξ² is defined by
[Ξ±,Ξ²]Eβ=βj=0Nβ1βΞ±jβΞ²jββZpsβ+uZpsβ.
Let C be a linear code over Zpsβ+uZpsβ of length N, i.e.,
a (Zpsβ+uZpsβ)-submodule of (Zpsβ+uZpsβ)N. The Euclidian dual code
of C is defined by Cβ₯Eβ={Ξ±β(Zpsβ+uZpsβ)Nβ£[Ξ±,Ξ²]Eβ=0,Β βΞ²βC}, and C is said to be self-dual if C=Cβ₯Eβ.
From now on, we define a mapping ΞΌ:AβA by
[TABLE]
Then one can easily verify that ΞΌ is a ring isomorphism from A onto A.
Precisely, by xN=(1+pw) in A and Lemma 4.1 it follows that
[TABLE]
and the inverse ΞΌβ1:AβA of ΞΌ is given by
[TABLE]
for all b(x)=βj=0Nβ1βbjβxjβA where bjββZpsβ.
For notations simplicity, we still denote ΞΌβ1 by
ΞΌ. Now, ΞΌ can be extended to a ring isomorphism between A+uA and A+uA
in the natural way that
[TABLE]
and
ΞΌ:Ξ·1β+uΞ·2ββ¦ΞΌ(Ξ·1β)+uΞΌ(Ξ·2β),Β βΞ·1β,Ξ·2ββA,
respectively.
Using the notations above, by a direct calculation we get the following
For any polynomial f(y)=βj=0dβcjβyjβZpsβ[y] of degree dβ₯1, recall that
the reciprocal polynomial of f(y) is defined as fβ(y)=ydf(y1β)=βj=0dβcjβydβj, and
f(y) is said to be self-reciprocal if fβ(y)=Ξ΄f(y) for some Ξ΄βZpsΓβ. Then by Equation (2.3) in Section 2, we have
[TABLE]
Since f1β(y),f2β(y),β¦,frβ(y) are pairwise coprime monic basic irreducible polynomials in Zpsβ[y],
it is known that fβ1β(y),fβ2β(y),β¦,fβrβ(y) are pairwise coprime monic basic polynomials in Zpsβ[y] as well. Hence for each integer i, 1β€iβ€r,
there is a unique integer iβ², 1β€iβ²β€r, such that
[TABLE]
Since
xpkn=1+pw=(1+pw0β)n in A, we see that
[TABLE]
Then by Equation (2.5) in Section 2 and (1+pw0β)β1=1+pw0β, we have
[TABLE]
where giβ(z)=Ξ΄iβznβdeg(biβ(y))βdiβbiβ(z)βZpsβ[z].
Similarly, we can prove that
ΞΌ(ΞΈiβ(x))=hiβ(xβpk(1+pw0β)β1)Fiβ(xβpk(1+pw0β)β1) for some
hiβ(z)βZpsβ[z].
From these and by Equation (11), we deduce that
ΞΌ(ΞΈiβ(x))=ΞΈiβ²β(x).
Therefore,
for each 1β€iβ€r there is a unique integer iβ², 1β€iβ²β€r, such that ΞΌ(ΞΈiβ(x))=ΞΈiβ²β(x). We still use ΞΌ to denote this map iβ¦iβ²; i.e.,
[TABLE]
Whether ΞΌ denotes the ring isomorphism between A+uA and A+uA or this map on the set {1,β¦,r} is determined by context.
The next lemma shows the compatibility of the two uses of ΞΌ.
Lemma 4.5With the notations above, we have the following:
(i) ΞΌ* is a permutation on {1,β¦,r} satisfying ΞΌβ1=ΞΌ*.
(ii) After a rearrangement of ΞΈ1β(x),β¦,ΞΈrβ(x) there are integers Ξ»,Ο΅ such that
ΞΌ(i)=i for all i=1,β¦,Ξ» and ΞΌ(Ξ»+j)=Ξ»+Ο΅+j for all j=1,β¦,Ο΅, where Ξ»β₯1,Ο΅β₯0 and Ξ»+2Ο΅=r.
(iii) For each integer i, 1β€iβ€r, there is a unique invertible element Ξ΄iβ of
Zpsβ such that fβiβ(y)=Ξ΄iβfΞΌ(i)β(y).
(iv) For any integer i, 1β€iβ€r, ΞΌ(ΞΈiβ(x))=ΞΈΞΌ(i)β(x),
ΞΌ(ΞΈiβ(x))=ΞΈΞΌ(i)β(x),
ΞΌ(Aiβ)=AΞΌ(i)β and ΞΌ(Aiβ)=AΞΌ(i)β. Then ΞΌ induces a ring isomorphism between Aiβ+uAiβ
and AΞΌ(i)β+uAΞΌ(i)β.
Proof (i)β(iii) follow from the definition of the map ΞΌ.
Lemma 4.6Let 1β€iβ€r. Denote by ΞΌβ£Aiββ the restriction
of ΞΌ to Aiβ and define ΞΌiβ:RiββRΞΌ(i)β by
ΞΌiβ(c(x))=c(xβ1)=βj=0pkdiββ1βcjβxβj (for all c(x)=βj=0pkdiββ1βcjβxj with cjββZpsβ).
Then ΞΌiβ is a ring isomorphism from Riβ onto RΞΌ(i)β such that the following
diagram commutes
[TABLE]
Moreover, ΞΌiβ can be extended to a ring isomorphism from Riβ+uRiβ
onto RΞΌ(i)β+uRΞΌ(i)β by the natural way:
ΞΌiβ:Ξ±+uΞ²β¦ΞΌiβ(Ξ±)+uΞΌiβ(Ξ²) for all Ξ±,Ξ²βRiβ.
Proof For any c(x)βRiβ, by Theorem 2.9(iii), Corollary 4.3(iii) and ΞΌ(ΞΈiβ(x))=ΞΈΞΌ(i)β(x)=1βgiβ(xpk(1+pw0β)β1)fΞΌ(i)β(xpk(1+pw0β)β1),
it follows that
[TABLE]
which implies ΞΌiβ(c(x))=((ΟΞΌ(i)β)β1ΞΌβ£AiββΟiβ)(c(x)) for all c(x)βRiβ. Hence
ΞΌiβ=(ΟΞΌ(i)β)β1ΞΌβ£AiββΟiβ, which is a ring isomorphism from
Riβ onto RΞΌ(i)β such that the diagram commutes.
Lemma 4.7Using the notations of Theorem 2.9(iv)* and Corollary 4.3*(iv), let Ξ±(x)=βi=1rβΞΈiβ(x)aiβ(x)βA+uA and Ξ²(x)=βi=1rβΞΈiβ(x)biβ(x)βA+uA,
where aiβ(x)βRiβ+uRiβ and biβ(x)βRiβ+uRiβ. Then
[TABLE]
where ΞΌ is the ring isomorphism from A+uA onto A+uA and ΞΌiβ1β:RΞΌ(i)β+uRΞΌ(i)ββRiβ+uRiβ
being the inverse of ΞΌiβ defined in Lemma 4.6 for all i=1,β¦,r.
Proof Since ΞΌ is the ring isomorphism from A+uA onto A+uA, by Lemma 4.5(iv) and Lemma 4.6 it follows that
[TABLE]
where ΞΌΞΌ(j)β1β is the inverse of the ring isomorphism ΞΌΞΌ(j)β from RΞΌ(j)β+uRΞΌ(j)β
onto Rjβ+uRjβ. Hence ΞΌΞΌ(j)β1β(bjβ(x))βRΞΌ(j)β+uRΞΌ(j)β
for all j. When j=ΞΌ(i), we have i=ΞΌ(j) by Lemma 4.5(i), and so ΞΌiβ1β(bΞΌ(i)β(x))βRiβ+uRiβ,
which implies aiβ(x)ΞΌiβ1β(bΞΌ(i)β(x))βRiβ+uRiβ for all i.
If jξ =ΞΌ(i), then iξ =ΞΌ(j) and hence ΞΈiβ(x)ΞΈΞΌ(j)β(x)=0 by Theorem 2.9(i). From these, by
ΞΌ(ΞΌ(i))=i and ΞΈiβ(x)2=ΞΈiβ(x) by Theorem 2.9(i) for all i, we deduce that
[TABLE]
i.e. Ξ±(x)ΞΌ(Ξ²(x))=βi=1rβΞΈiβ(x)(aiβ(x)ΞΌiβ1β(bΞΌ(i)β(x)).
β‘
Lemma 4.8Using the notations of Lemma 4.6,
we have that
ΞΌiβ(fiβ(x)l)=Ξ΄ilβxβldiβfΞΌ(i)β(x)lβRΞΌ(i)β for all 1β€lβ€pks.
Proof By Lemma 4.5(iii), we have fβiβ(x)=Ξ΄iβfΞΌ(i)β(x). From this and by
the definition of ΞΌiβ in Lemma 4.6, we deduce that
ΞΌiβ(fiβ(x)l)=fiβ(xβ1)l=xβldiβ(xdiβfiβ(xβ1))l=xβldiβfβiβ(x)l=Ξ΄ilβxβldiβfΞΌ(i)β(x)l.β‘
Now, we give the dual code of each (1+pw)-constacyclic code over the ring Zpsβ+uZpsβ
of length N where N=pkn.
Theorem 4.9Let C be a (1+pw)-constacyclic code
over Zpsβ+uZpsβ of length N with
C=βi=1rβΞΈiβ(x)Ciβ, where Ciβ is an ideal of Riβ+uRiβ. Then
the dual code Cβ₯Eβ is a (1+pw)-constacyclic code
over Zpsβ+uZpsβ of length N. Precisely, Cβ₯Eβ is given byCβ₯Eβ=βj=1rβΞΈjβ(x)Djβ,where Djβ is an ideal of Rjβ+uRjβ given by the following table:
[TABLE]
Proof For each integer i, 1β€iβ€r, let
Jiβ be an ideal of Riβ+uRiβ given by one of the following eight cases:
Then it follows that
Ciββ Jiβ={0} by a straightforward computation.
Furthermore, by Theorem 3.3 we see that β£Ciββ£β£Jiββ£=p2pksdiβ.
Let 1β€iβ€r and denote DΞΌ(i)β=ΞΌiβ(Jiβ). By Lemma 4.6 we conclude that
DΞΌ(i)β is an ideal of RΞΌ(i)β+uRΞΌ(i)β, β£DΞΌ(i)ββ£=β£Jiββ£.
and ΞΌiβ1β(DΞΌ(i)β)=Jiβ. We set
D=βi=1rβΞΈΞΌ(i)β(x)DΞΌ(i)β=βj=1rβΞΈjβ(x)Djβ
(mod xpknβ(1+pw)). Then by the conclusion paralleling to Lemma 3.2, we see that
D is a (1+pw)-constacyclic code over Zpsβ+uZpsβ of length pkn. Moreover,
by Lemma 4.7 and Ciββ ΞΌiβ1β(DΞΌ(i)β)=Ciββ Jiβ={0} it follows that
[TABLE]
which implies DβCβ₯Eβ by Lemma 4.4. On the other hand, by Lemma 3.1 and Corollary 4.3(iii)
we have
[TABLE]
Since both C and D are linear codes over Zpsβ+uZpsβ of length pkn
and Zpsβ+uZpsβ is a finite Frobenius ring, from the theory of linear codes over Frobenius rings (see [13], for example)
we deduce that Cβ₯Eβ=D.
Finally, we give the precise representation of each DΞΌ(i)β, 1β€iβ€r.
where h(x)=βΞ΄iβliββxliβdiβh(xβ1)βAΞΌ(i)Γβ.
Cases 5, 7 and 8 can be obtained similarly as Cases 1, 3 and 4.
β‘
Finally, we consider the self-duality of the constacyclic codes over Zpsβ+uZpsβ.
When p is odd, by Lemma 2.6 we know that (1+pw)β1ξ =1+pw for all wβZpsΓβ.
Let p=2 and wβZ2sΓβ. Then it is clear that (1+2w)β1=1+2w if and only if
w=2sβ2β1 or 2sβ1β1 when sβ₯3, and w=1 when s=2.
Now, let p=2, and w=2sβ2β1 or 2sβ1β1 if sβ₯3, and w=1 if s=2. We assume N=2kn where n is an odd positive
integer.
Then (1+2w)2=1βZ2sΓβ. In this case, Using the notations of Lemma 2.6 and Lemma 4.1 we have
1+2w0β=1+2w=1+2w=1+2w0β. Furthermore, using Equations (2.5)
and (4.1) it follows that
[TABLE]
which implies Aiβ=Aiβ for all i=1,β¦,r. Then
as a corollary of Lemma 3.2, Theorems 3.3 and 4.9, we can present all distinct self-dual (1+2w)-constacyclic
codes over the ring Z2sβ+uZ2sβ by the following theorem.
Theorem 4.10Let w=2sβ2β1 or 2sβ1β1 when sβ₯3, and w=1 when s=2.
Using the notations in Theorem 4.9, Lemma 4.5(ii) and Equation (12),
let C be a (1+2w)-constacyclic code
over Z2sβ+uZ2sβ of length N with
C=βi=1rβΞΈiβ(x)Ciβ, where Ciβ is an ideal of Riβ+uRiβ. Then
C is self-dual if and only if for each integer i, 1β€iβ€r, Ciβ satisfies one
of the following conditions:
βIf i=Ξ»+j where 1β€jβ€Ο΅, (Ciβ,Ci+Ο΅β) are given by the following table:
[TABLE]
βIf 1β€iβ€Ξ», Ciβ is given by one of the following six cases:
In this section, we consider how to construct all distinct self-dual 3-constacyclic codes over Z8β+uZ8β (u2=0) of length 14.
In this case, we have N=2kn with k=1, n=7, p=2, s=3 and 1+pw=3 satisfying 32=1 in Z8β.
It is known that
y7β1=f1β(y)f2β(y)f3β(y),
where
f1β(y)=yβ1, f2β(y)=y3+6y2+5y+7 and f3β(y)=y3+3y2+2y+7
are pairwise coprime minic basic irreducible polynomials in Z8β[y].
As d1β=1, d2β=d3β=3 and r=3, by Theorem 3.3 and Corollary 3.4, the number N of 3-constacyclic codes over Z8β+uZ8β of length 14
is equal to N=βi=13β(23diβ+5β 22diβ+9β 2diβ+13)=59β 9172=49,612,451.
Obviously, fβ1β(y)=Ξ΄1βf1β(y) and fβ2β(y)=Ξ΄2βf3β(y) where Ξ΄1β=Ξ΄2β=β1, which implies that
ΞΌ(1)=1 and ΞΌ(2)=3. Hence Ξ»=Ο΅=1.
For each integer i, 1β€iβ€3, we denote
Fiβ(y)=fiβ(y)y7β1β, and find polynomials aiβ(y),biβ(y)βZ8β[y]
satisfying aiβ(y)Fiβ(y)+biβ(y)fiβ(y)=1. Then set Ο±iβ(y)β‘aiβ(y)Fiβ(y) (mod y7β1). By Equation (4.2) in Section 4, it follows that
ΞΈiβ(x)β‘Ο±iβ(3x2) (mod x14+1) in Z8β[x]. Precisely, we have
β(C2β,C3β) is given by the following table, where
Ciβ is an ideal of Riβ+uRiβ for i=2,3, and L(C2β,C3β)β is the
number of pairs (C2β,C3β) on the same line.
[TABLE]
where Ξk(2)β={βj=0kβ1βbjβ(x)f2β(x)jβ£bjβ(x)βT2β,b0β(x)ξ =0,0β€jβ€kβ1} with T2β={a0β+a1βx+a2βx2β£a0β,a1β,a2ββ{0,1}}, for k=1,2,3.
Therefore, the number of self-dual 3-constacyclic codes over Z8β+uZ8β of length
14 is equal to 7β 917=6419.
Acknowledgments
Part of this work was done when Yonglin Cao was visiting Chen Institute of Mathematics, Nankai University, Tianjin, China. Yonglin Cao would like to thank the institution for the kind hospitality. This research is
supported in part by the National Natural Science Foundation of
China (Grant Nos. 11671235, 11471255).
Appendix A A direct proof for Equation (2.1)
Denote Ξ·=1+pw0ββZpsΓβ. By Lemma 2.4(ii), we have
f(Ξ·β1xpk)=βi=0dβ1β(Ξ·β1xpkβΞΆpi)=Ξ·βdβi=0dβ1β(xpkβΞ·ΞΆpi).
As xpkβΞ·ΞΆpi=(xpkβΞΆpi)βpw0βΞΆpi,
we have f(Ξ·β1xpk)=Ξ·βdβi=0dβ1β(xpkβΞΆpi)βpg1β(x)+p2g2β(x) where
[TABLE]
and g2β(x)βΞ[x]. By Lemma 2.4(ii) we have
[TABLE]
where aiβ(x)βΞ[x] satisfies (xβΞΆpi)pk=xpkβ(ΞΆpi)pk+paiβ(x),
[TABLE]
and h2β(x)βΞ[x]. In fact, we have
a_{i}(x)=\sum_{t=1}^{p^{k}-1}\frac{1}{p}\left(\begin{array}[]{c}p^{k}\cr t\end{array}\right)(-\zeta^{p^{i}})^{t}x^{p^{k}(p^{k}-t)}
where
\frac{1}{p}\left(\begin{array}[]{c}p^{k}\cr t\end{array}\right)=\frac{1}{p}\frac{p^{k}!}{(p^{k}-t)!t!}\in\mathbb{Z} for
all t=1,β¦,pkβ1, when p is odd. Let p=2. Then
a_{i}(x)=\zeta^{2^{i+k}}+\sum_{t=1}^{2^{k}-1}\frac{1}{2}\left(\begin{array}[]{c}2^{k}\cr t\end{array}\right)(-\zeta^{2^{i}})^{t}x^{2^{k}(2^{k}-t)}
where
\frac{1}{2}\left(\begin{array}[]{c}2^{k}\cr t\end{array}\right)=\frac{1}{2}\frac{2^{k}!}{(2^{k}-t)!t!}\in\mathbb{Z} for
all t=1,β¦,2kβ1.
By Lemma 2.4(i), we know that ΞΆpd=ΞΆ=ΞΆp0, which implies
βi=0dβ1β(xpkβΞΆpi)=βi=0dβ1β(xpkβΞΆpi+k), and hence
[TABLE]
Now, denote Ο(x)=h1β(x)+Ξ·dg1β(x)+p(h2β(x)βΞ·dg2β(x)). Then
[TABLE]
which implies Ο(x)βZpsβ[x], hence we see that
[TABLE]
by (1+pw0β)β1βZpsβ={0,1,β¦,psβ1}. Moreover, we have
[TABLE]
By Lemma 2.4(i), we know that ΞΆpd=ΞΆ=ΞΆp0 in the Galois ring Ξ, which implies
ΞΆβpd=ΞΆβp0 in the finite field Ξ.
From this and by Equations (A.1) and (A.2), we have
[TABLE]
[TABLE]
By Lemma 2.4(i), we know that ΞΆβ,ΞΆβp,β¦,ΞΆβpdβ1 are all distinct roots
of fβ(x) in Ξ. Then for any integer i, 0β€iβ€dβ1, we have
β0β€jβ€dβ1,jξ =iβ(ΞΆβpiβΞΆβpj)pk=(β0β€jβ€dβ1,jξ =iβ(ΞΆβpiβΞΆβpj))pkξ =0
and β0β€jβ€dβ1,jξ =iβ(ΞΆβptβΞΆβpj)pk=0 for all tξ =i.
Therefore,
[TABLE]
By (xβΞΆpi)pk=xpkβ(ΞΆpi)pk+paiβ(x) in Ξ[x], we have
[TABLE]
Since Ξ is a finite chain with the unique maximal ideal generated by p and sβ₯2 is the nilpotency index of p, we conclude
that aiβ(ΞΆpi)=psβ1Ξ± for some Ξ±βΞ (see [14], for example), which then implies
aiβ(ΞΆβpi)=aiβ(ΞΆpi)β=0 and hence h1β(ΞΆβpi)=0 in Ξ.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Abualrub T., Oehmke, R.: On the generators of β€ 4 subscript β€ 4 \mathbb{Z}_{4} cyclic codes of lenth 2 e superscript 2 π 2^{e} , IEEE Trans. Inform. Theory 49 (2003), 2126β2133.
2[2] Abualrub T., Siap I.: Cyclic codes over the ring β€ 2 + u β β€ 2 subscript β€ 2 π’ subscript β€ 2 \mathbb{Z}_{2}+u\mathbb{Z}_{2} and β€ 2 + u β β€ 2 + u 2 β β€ 2 subscript β€ 2 π’ subscript β€ 2 superscript π’ 2 subscript β€ 2 \mathbb{Z}_{2}+u\mathbb{Z}_{2}+u^{2}\mathbb{Z}_{2} . Des. Codes Cryptogr. 42 , 273β287 (2007).
3[3] Blackford, T.: Negacyclic codes over β€ 4 subscript β€ 4 \mathbb{Z}_{4} of even length, IEEE Trans. Inform. Theory 49 (2003), 1417β1424.
4[4] Bonnecaze, A., Udaya, P: Cyclic codes and self-dual codes over π½ 2 + u β π½ 2 subscript π½ 2 π’ subscript π½ 2 \mathbb{F}_{2}+u\mathbb{F}_{2} , IEEE Trans. Inform. Theory 45 (1999), 1250β1255.
5[5] Cao Y.: On constacyclic codes over finite chain rings, Finite Fields Appl. 24 (2013), 124β135.
8[8] Cao Y., Cao Y., Li Q.: Concatenated structure of cyclic codes over β€ 4 subscript β€ 4 \mathbb{Z}_{4} of length 4 β n 4 π 4n , Appl. Algebra in Engrg. Commun. Comput. 27 (2016), 279β302.