Acessibilidade / Reportar erro

Construction of Complex Lattice Codes via Cyclotomic Fields

ABSTRACT

Through algebraic number theory and Construction A we extend an algebraic procedure which generates nested complex lattice codes from the polynomial ring F2x/xn-1, where F2=0,1, by using ideals from the generalized polynomial ring F2x,120x122n-1 through the ring of integers 𝒪𝕃 of the cyclotomic field L=ζ2s, where ζ2s is a 2s -th root of the unit, with s > 2.

Keywords:
complex lattice codes; binary cyclotomic fields; monoid Rings

1 INTRODUCTION

Several works 55 G.D. Forney. Coset Codes - Part I: Introduction and Geometrical Classification. IEEE Transactions on Information Theory , 34(5) (1988), 1123-1151.), (66 G.D. Forney . Coset Codes - Part II: binary lattices and related codes. IEEE Transactions on Information Theory , 34(5) (1988), 1152-1187.), (33 J.H. Conway & N.J.A. Sloane. “Sphere Packings, Lattices and Groups”. Springer-Verlag, New York (1988).), (1010 C.C. Trinca. “A contribuition to the study of channel coding in wireless communication systems”. Ph.D. thesis, Universidade Estadual Paulista (UNESP), Ilha Solteira, SP (2013). PhD Thesis.), (88 F. Oggier & J.C. Belfiore. Enabling multiplication in lattice codes via Construction A. In “2013 IEEE Information Theory Workshop (ITW)”, volume 1. IEEE (2013), p. 1-5. over lattice theory have been dedicated to Construction A and lattice set partitioning via coset codes. The advantage of these algebraic approaches is that it is possible to unify different coding problems related to algebraic block codes and Euclidean space codes.

Construction A has been introduced by Conway and Sloane 33 J.H. Conway & N.J.A. Sloane. “Sphere Packings, Lattices and Groups”. Springer-Verlag, New York (1988). where the authors establish an algebraic correspondence between lattices from ℝn or ℂn and linear codes over finite fields 𝔽p . Codes obtained by Construction A are denominated lattice codes.

In this work we have interest in scaled versions of the ℤ[i]n -lattice, i.e., complex lattices isomorphic to the lattice ϕk ℤ[i]n , for some Gaussian integer ϕ and some positive integer k. Such n-dimensional complex lattices are the simplest lattices obtained in ℂn . Since we consider the ℤ[i]n -lattice generated by the canonical basis, it is simple to characterize the corresponding fundamental region.

From a chain of nested binary cyclic codes given by equation (1.1)

C n - 1 C n - 2 C 1 C 0 (1.1)

and a chain of nested complex lattices given by equation (1.2)

1 + i n - 1 i n 1 + i n - 2 i n 1 + i i n i n , (1.2)

Forney in 55 G.D. Forney. Coset Codes - Part I: Introduction and Geometrical Classification. IEEE Transactions on Information Theory , 34(5) (1988), 1123-1151. proposes a practical way to encoding lattices via Construction A, therefore each binary cyclic code 𝒞k can be seen as the set of all n-tuples reduced by the residue system of the complex lattice 1+ikin modulo (1 + i).

By using this algebraic approach, Forney 55 G.D. Forney. Coset Codes - Part I: Introduction and Geometrical Classification. IEEE Transactions on Information Theory , 34(5) (1988), 1123-1151. shows how binary codes, lattice codes and trellis codes can be constructed as coset codes. These cosets are formed by the sequences of signal points of the outputs of binary encoders. As a consequence of the identification of the complex coset codes 1+ikin/1+iin with the binary codes 𝒞k , respectively, we can see the algebraic block codes 𝒞k55 G.D. Forney. Coset Codes - Part I: Introduction and Geometrical Classification. IEEE Transactions on Information Theory , 34(5) (1988), 1123-1151. as principal ideals of the factor ring F2x/xn-1 of the Euclidean domain 𝔽2[x], where 𝔽2 denotes the binary field.

On the other hand, Andrade and Palazzo 44 A.A. de Andrade & R.P. Junior. Linear codes over finite rings. Tendências em Matemática Aplicada e Computacional (TEMA), 6(2) (2005), 207-217. propose a new method to construct cyclic, BCH, alternant, Goppa and Srivastava codes. In this new algebraic approach the authors obtain cyclic codes from principal ideals of the factor ring Fpx/xn-1 of the polynomial ring 𝔽p [x], where 𝔽p denotes the finite field, while Shah et al. 11 T.S. Amanullah & A.A. de Andrade. A Decoding Procedure which Improves Code Rate and Error Corrections. Journal of Advanced Research in Applied Mathematics, 4(4) (2012), 37-50. use a monoid ring instead of a polynomial ring and also obtain cyclic, BCH, alternant, Goppa and Srivastava codes.

The main goal of this work is to extend the procedure of constructing complex lattice codes on ℂn via the polynomial ring F2x/xn-1 to the monoid ring F2x,120x122n-1.11 T.S. Amanullah & A.A. de Andrade. A Decoding Procedure which Improves Code Rate and Error Corrections. Journal of Advanced Research in Applied Mathematics, 4(4) (2012), 37-50. If we continue the discussion of lattice codes from an algebraic and geometric point of view, the following question appears in this context:

Is it possible to obtain a similar algebraic/geometric procedure to obtain a correspondence between binary algebraic block codes obtained from monoid rings and binary lattice codes?

The goal of this paper is to develop fundamental tolls from the theory of algebraic lattices and linear codes over the polynomial ring F2x/xn-1 and the monoid ring F2x,120x122n-1 to answer this question. Algebraic number theory provides an effective mean to construct scaled versions of the ℤ[i]n -lattice obtained via totally complex number fields 1212 E.B. X. Giraud & J.C. Belfiore . Algebraic tools to build modulation schemes for fading channels. IEEE Transactions on Information Theory , 43(3) (1997), 938-952.), (22 J. Boutros & E. Viterbo. Signal space diversity: a power-and bandwidth-efficient diversity technique for the Rayleigh fading channel. IEEE Transactions on Information Theory, 44(4) (1998), 1453-1467.) and 1111 C.C. Trinca , J.C. Belfiore , E.D. de Carvalho, J. Vieira Filho, R. Palazzo Jr. & R.A. Watanabe. Construction of Complex Nested Ideal Lattices for Complex-Valued Channel Quantization. International Journal of Applied Mathematics, 31(4) (2018), 549-585.. These scaled versions of the ℤ[i]n -lattice are given by algebraic lattices obtained via the canonical embeddings applied on ideals from a ring of a totally complex number field.

By using concepts from the ramification index of the prime ideal I=1-ζ2s on the Galois extension ζ2s/i of degree n = 2s−2 , we establish a general correspondence between the sequence of the ideals Ik=1-ζ2skζ2s, where k0,1,,n-1, and the sequence of the nested lattices Λk which are a scaled version of the ℤ[i]n -lattice and are obtained through the relative embedding of the ideals ℐk in ℂn , where ζ2s is the algebraic ring of integer of the number field ζ2s and ζ2s is a 2s -th root of unity.

Consequently, this leads us two similar algebraic procedures. In the first one we identify the sets of all n-tuples reduced by the residue system of the nested complex lattices Λk modulo (1 + i) with complex lattice codes proposed by Forney 55 G.D. Forney. Coset Codes - Part I: Introduction and Geometrical Classification. IEEE Transactions on Information Theory , 34(5) (1988), 1123-1151. as ideals from the factor ring F2x/xn-1. In the second one we rewrite the ζ2s-th root of unity and, consequently, we also identify the sets of all n-tuples reduced by the residue system of the nested complex lattices Λk modulo (1+ i) with complex lattice codes proposed by Forney 55 G.D. Forney. Coset Codes - Part I: Introduction and Geometrical Classification. IEEE Transactions on Information Theory , 34(5) (1988), 1123-1151. as ideals from the monoid ring F2x,120x122n-1 11 T.S. Amanullah & A.A. de Andrade. A Decoding Procedure which Improves Code Rate and Error Corrections. Journal of Advanced Research in Applied Mathematics, 4(4) (2012), 37-50..

2 GENERALIZED POLYNOMIALS AND CYCLIC CODES

Let (S, ∗) and (ℛ, +, ·) be a commutative semigroup and an associative, commutative and unitary ring, respectively. The set 𝒯 is given by all finite nonzero functions f from S to , where is a ring with respect to the addition and multiplication operations which are defined as: f+gs=fs+gs and f·gs=t*u=sftgu, where the symbol t*u=s indicates that the sum is taken over all the pairs (t u) of elements from S such that t*u=s. Whenever s cannot be written on the form t*u, with t,uS, then it is settled that f·gs=0.

If S is monoid, then 𝒯 is called monoid ring. This ring 𝒯 is represented by ℛ[S] whenever S is a multiplicative semigroup and the elements of 𝒯 are written either as sSfss or as i=1nfsisi.

The representation of 𝒯 is given by ℛ[x; S] whenever S is an additive semigroup. A nonzero element f of ℛ[x; S] is uniquely represented in the canonical form i=1nfsixsi=i=1nfixsi, where fi0 and sisj, for ij, and is called generalized polynomial.

The concepts of degree and order are not generally defined in a semigroup ring. Though, if S is a totally ordered semigroup, then the degree and the order of an element of the monoid ring ℛ[x; S] can be defined. If f=i=1nfissi is the canonical form of the nonzero element fRx;S, where s 1 < s 2 < · · · < s n , then s n is called the degree of f and we denote it by degf=sn. Analogously, the order of f is defined and denoted by ordf=s1. Now, if ℛ is an integral domain, then, for f,gRx;S, it follows that degfg=degf+degg and ordfg=ordf+ordg. By 11 T.S. Amanullah & A.A. de Andrade. A Decoding Procedure which Improves Code Rate and Error Corrections. Journal of Advanced Research in Applied Mathematics, 4(4) (2012), 37-50., for a commutative ring B with identity, R=Bx,120x12n-1 is a finite ring.

A linear code 𝒞 of length n over B is a submodule in the space of all n-tuples of B n and 𝒞 is a cyclic code, if v=v0,v12,v1,,vn-12C, every cyclic shift v1=vn-12,v0,v12,,vn-2C, where vi2B, for i=0,1,,n-1.

Theorem 2.1.11 T.S. Amanullah & A.A. de Andrade. A Decoding Procedure which Improves Code Rate and Error Corrections. Journal of Advanced Research in Applied Mathematics, 4(4) (2012), 37-50.A subset C ofR=Bx,120x12n-1is a cyclic code if and only if C is an ideal of.

If fx12Bx,120 is a monic pseudo polynomial of degree n, then R=Bx,120fx12 is the set of residue classes of pseudo polynomials in Bx,120 module the ideal fx12 and a class can be represented as ax12=a0+a12x12+a1x++an-12x12n-12..

Let B=F2x, where 𝔽2 is the binary field.

Proposition 2.2.The binary polynomial xn − 1 is factored over the ring 𝔽2[x] as the product of n monomials of the form (x − 1), i.e.,

x n - 1 = x - 1 n .

Proof. Over the polynomial ring 𝔽2[x], it follows that xn-1=x-1n. In fact, from Newton’s binomial theorem for x-1n, it follows that

x - 1 n = x n + 1 n x n - 1 - 1 + + n n - 1 n . (2.1)

Since n = 2s and the coefficients are in 𝔽2, then it follows that xn-1=x-1n (observe that -11mod2). Therefore the polynomial x n − 1 can be written as

x n - 1 = x - 1 x - 1 n t i m e s . (2.2)

From Equation (2.2), it follows that the binary polynomial x n − 1 has 2n divisors in 𝔽2[x]. Thenceforth there are 2n cyclic codes generated by the binary polynomials which divide the polynomial x n − 1 in the polynomial ring 𝔽2[x]. Let F2x,120, where 𝔽2 is the binary field, then we have the following result.

Proposition 2.3.The generalized polynomialx122n-1is factored in the generalized polynomial ringF2x,120as the product of 2n generalized monomials of the formx12-1, i.e.,

x 1 2 2 n - 1 = x 1 2 - 1 2 n .

Proof. Analogously to the proof of Proposition 2.2, it follows that

x 1 2 2 n - 1 = x 1 2 - 1 x 1 2 - 1 2 n t i m e s , (2.3)

which proves the result. □

It is provided from Equation (2.3) that the generalized polynomial x122n-1 has 22n divisors in F2x,120. Then there are 22n cyclic codes generated by the generalized polynomials which divide the generalized polynomial x122n-1 in the generalized polynomial ring F2x,120.

3 RESULTS FROM ALGEBRAIC NUMBER THEORY

Let 𝔽 and 𝕃 be fields such that FL. We say that 𝕃 is a finite extension of 𝔽 if the dimension of 𝕃 as a vector space over 𝔽 is finite and we denote it by 𝕃/𝔽.

The Galois group Gal(𝕃/𝔽) associated with the finite extension 𝕃/𝔽 is defined as the set of all automorphisms σ of 𝕃 that fix every element of 𝔽. The order of the Galois group satisfies o(Gal(L/F))[L:F]. The extension field is said to be Galois if the equality holds and it is called Abelian (cyclic) if the Galois group is Abelian (cyclic). We say that 𝕃 is an algebraic number field if 𝔽 = ℚ, that is, if 𝕃 is a finite extension of ℚ.

If 𝕃 is an algebraic number field, an element wL is called an algebraic integer if there is a monic polynomial p(x)[x] such that p(w) = 0. The set

O L = { w L | w is an algebraic integer } (3.1)

is called ring of integers of 𝕃. It can be shown that 𝒪𝕃 as a ℤ-module has a basis {w 0 , . . . , w n−1 } over ℤ called integral basis, that is, every element wOL can be uniquely written as w=i=1naiwi, where ai, for all i = 1, 2,· · · , n.

Example 3.1. Let 𝕃 a cyclotomic field given byL=(ζ2s), withs2, where ζ2 s is a primitive 2s -th root of unity. Furthermore:

  • 1. This extension field is a Galois extension with

  • G a l ( L / ) = { σ j : σ j ( ζ m ) = ζ m j , w h e r e g c d ( m , j ) = 1 }

  • which is a cyclic multiplicative group of order2s-1=φ(2s)=#{0m<2s | gcd(m,2s)=1, m} . The function φ is called Euler function;

  • 2. We denote the ring of integers of 𝕃 byOL=[ζ2s]and its integral basis is given by{1,ζ2s,ζ2s2,,ζ2sφ(2s)-1}={1,ζ2s,ζ2s2,,ζ2s2s-1-1} .

Let ζ2s-1 and ζ2s denoted by 𝕃s−1 and 𝕃s , respectively. Consequently we have Ls=Ls-1(ζ2s). Thenceforward we obtain the following tower of finite extension fields

L s / L s - 1 / / L 3 / L 2 ,

where [L=Ls:Ls-1]=[Ls-1 : Ls-2]==[L3 : L2]=2 and L2=(ζ4)=(i). Also the minimal polynomial μζ2s(x) of ζ2 s over ℤ[i] has degree and it is given by φ(2s)2=2s-12=2s-2

μ ζ 2 s ( x ) = i = 0 2 s - 2 - 1 ( x - ζ 2 s i ) . (3.2)

From there the 2s−2 distinct ℚ(i)-homomorphisms are denoted by σ i , where i{0,,2s-2-1}, and σi(ζ2s)=ζ2si, for all i{0,,2s-2-1}.

If 𝕃 is an algebraic number field of degree n, then the trace and the norm of an element wL are defined as the numbers TrL/(w)=i=0n-1σi(w) and NL/(w)=i=0n-1σi(w), respectively. Furthermore:

  • 1. If 𝕃/𝕂/ℚ is a tower of finite extension fields, then, for each wL , it follows that

N L / ( w ) = N K / ( N L / K ( w ) ) ; (3.3)

  • 2. If x,yL , then

N L / ( x y ) = N L / ( x ) N L / ( y ) . (3.4)

Let {w0, w1,··· , wN−1} be an integral basis of 𝒪𝕃 and let ℑ be an ideal of 𝒪𝕃. The norm of ℑ is defined by NL/(I)=|OL/I|, i.e., it is the cardinality of the quotient ring 𝒪𝕃/ℑ. If ζ2 s is a 2s -th root of unity, then ζ2s2=ζ2s-1 or, equivalently,

ζ 2 s = ζ 2 s - 1 1 2 . (3.5)

Lemma 3.1.Ifs3, thenN(ζ2s)/(ζ2s-1)(1-ζ2s)=1-ζ2s-1.

Proof. The finite extension field (ζ2s)/(ζ2s-1) has degree 2. Consequently, we can see ℚ(ζ2 s) as a field extension of the field (ζ2s-1) whose minimal polynomial is given by m(x)=x2-ζ2s-1 and the Galois group is given by G((ζ2s)/(ζ2s-1)={id,σ1}, where id(ζ2s)=ζ2s and σ1(ζ2s)=-ζ2s. Therefore, N(ζ2s)/(ζ2s-1)(1-ζ2s)=(1-ζ2s)(1+ζ2s)=1-ζ2s2=1-ζ2s-1. □

Proposition 3.2.Ifs3, thenN(ζ2s)/(i)(1-ζ2s)=1-i.

Proof. If s = 3, then N(ζ23)/(i)(1-ζ23)=N(ζ23)/(ζ22)(1-ζ23). By Lemma 3.1, we have that N(ζ23)/(ζ22)(1-ζ23)=1-ζ22=1-i. Now we consider an induction over s − 1, that is, suppose that N(ζ2s-1)/(i)(1-ζ2s-1)=1-i. By using the fact that the property of relative norm on finite extensions is transitive, we have

N ( ζ 2 s ) / ( i ) ( 1 - ζ 2 s ) = N ( ζ 2 s - 1 ) / ( i ) ( N ( ζ 2 s ) / ( ζ 2 s - 1 ) ( 1 - ζ 2 s ) ) .

By Lemma 3.1, it follows that N(ζ2s)/(ζ2s-1)(1-ζ2s)=1-ζ2s-1. Thus, by using induction over s − 1, we have that N(ζ2s)/(i)(1-ζ2s)=1-i. □

Remark 3.3.Since[(ζ2s) : (i)]=n, from Proposition 3.2, it follows that(1-i)[ζ2s]is completely factored as a power of prime ideal in ℤ[ζ2 s] of the form(1-i)[ζ2s]=(1-ζ2s-1)n[ζ2s], wheren=φ(2s)2=2s-12=2s-2

4 COMPLEX LATTICES AND LATTICE CODES

If Λ is an n-dimensional complex lattice with basis {u 1 , u 2 ,..., u m }, then its generator matrix is given by

M = u 11 u 12 u 1 n u 21 u 22 u 2 n u m 1 u m 2 u m n ,

where u i = (u i1 , u i2 , . . . , u in ), for i = 1, 2, . . . , m.

The matrix G = MM T is called Gram matrix of the complex lattice Λ, where M T denotes the transpose of M. We can also define Λ={x=λM | λ[i]m}. The determinant of the lattice Λ is defined as the determinant of the matrix G, that is, Det(Λ) = Det(G).

The fundamental parallelepiped of Λ is the set 𝒫 0 formed by all points in ℂn which are convex combinations of vectors of the basis, that is, P0={x=i=1mαiui | αi0 and i=1mαi=1}.

A subset Λ'Λ is called sublattice if Λ’ itself is a lattice, i.e, Λ’ is an additive subgroup of Λ. The sublattice Λ’ can also be characterized as Λ'={x=λBM | λ[i]m}, where M is the generator matrix associated with the lattice Λ and B is a scaling matrix with integral entries.

The sublattice Λ’ induces a partition of Λ into classes which is called quotient lattice and it is denoted by Λ/Λ’. The cardinality of Λ/Λ’ is given by

| Λ / Λ ' | = v o l u m e ( P 0 ' ) v o l u m e ( P 0 ) = | d e t ( B ) | , (4.1)

where volume(𝒫’ 0) and volume(𝒫 0) denote the volume of the fundamental parallelepiped 𝒫’ 0 (associated with the sublattice Λ’) and the volume of the fundamental parallelepiped 𝒫 0 (associated with the lattice Λ), respectively.

4.1 Complex ideal lattices from ℚ(ζ 2 s)

In Section 4.2 we build, for each n, a chain of nested complex lattices which are isomorphic to scaled versions of the lattice ℤ[i]n . For that we make use of ideal lattices which are obtained from ideals of the ring of integers of the cyclotomic field ℚ(ζ 2 s).

Let 𝕃 = ℚ(ζ 2 s) be a finite extension field over ℚ(i) with degree n = 2s−2 , where s3. From an ideal IOL=[ζ2s] (ring of integers of the number field 𝕃), we can obtain a complex algebraic lattice Λ by using the relative complex embedding of 𝕃 into ℂn which is defined as it follows:

σ : L n , with σ ( x ) = ( σ 0 ( x ) , , σ n - 1 ( x ) ) , (4.2)

where σiGal(L/(i)), for all i{0,1,,n-1}.

Remark 4.1.Note that the lattice Λ inn is obtained through the relative complex embedding (4.2) applied to the ideal. Besides the application (4.2) establishes an isomorphism between 𝒪 𝕃 and the ℤ[i]n -lattice.

Let {1,ζ2s,,ζ2sn-1} be a ℤ[i]-basis of the ring of integers ℤ[ζ 2 s], then a generator matrix M of the complex lattice Z[i]n is given by

M = σ 0 ( 1 ) σ n - 1 ( 1 ) σ 0 ( ζ 2 s n - 1 ) σ n - 1 ( ζ 2 s n - 1 ) . (4.3)

Proposition 4.2.77 F. Oggier. “Algebraic methods for channel coding”. Ph.D. thesis, École Polytechnique Fédérale de Lausanne, Lausanne (2005). PhD Thesis.The matrix M obtained from Equation (4.3) is a generator matrix of the complex ideal lattice ℤ[i]n if, and only if, the complex conjugation commutes with all σ i , for alli{0,1,, n-1}.

The field ℚ(ζ 2 s), where s3, is a CM field, i.e., ℚ(ζ 2 s) is a totally imaginary quadratic extension of K=(θ), where θ=ζ2s+ζ2s-1.

Proposition 4.3.77 F. Oggier. “Algebraic methods for channel coding”. Ph.D. thesis, École Polytechnique Fédérale de Lausanne, Lausanne (2005). PhD Thesis.A complex ideal latticeΛ=(I,b)is a ℤ[i]-lattice, whereis a ℤ[ζ 2 s]-ideal, b is a bilinear form given byb(x,y)=T(ζ2s)/(i)(xy¯), for allx,yI, anda¯=a1+a2i¯=a1-a2idenotes the complex conjugation in ℤ[i].

The matrix

G = M M ¯ t = i = 0 n - 1 σ i ( 1 ) σ i ( 1 ) ¯ i = 0 n - 1 σ i ( 1 ) σ i ( ζ 2 s n - 1 ) ¯ i = 0 n - 1 σ i ( ζ 2 s n - 1 ) σ i ( 1 ) ¯ i = 0 n - 1 σ i ( ζ 2 s n - 1 ) σ i ( ζ 2 s n - 1 ) ¯ (4.4)

is called Gram matrix of the ideal lattice ℤ[i]n .

Next proposition provides us complex ideal lattices related to principal ideals.

Proposition 4.4.77 F. Oggier. “Algebraic methods for channel coding”. Ph.D. thesis, École Polytechnique Fédérale de Lausanne, Lausanne (2005). PhD Thesis.LetI=α[ζ2s]be a principal ideal of ℤ[ζ 2 s]. ThenΛ=(I,b)is a complex ideal lattice over ℤ[i], where b is a bilinear form given byb(x,y)=cT[ζ2s]/(i)(xy¯), for allx,yI, and c is a normalized factor.

Observe that T[ζ2s]/(i)(αwjα¯wj¯)j=0n-1 can be written as the product of matrices given by MUU¯tM¯t, where M is the matrix related to the relative embedding defined in (4.3) and U=dig(σ0(α),,σn-1(α)).

4.2 Scaled versions of the ℤ[i] n -lattice from ℚ(ζ 2 s)

Trinca et al. in 1111 C.C. Trinca , J.C. Belfiore , E.D. de Carvalho, J. Vieira Filho, R. Palazzo Jr. & R.A. Watanabe. Construction of Complex Nested Ideal Lattices for Complex-Valued Channel Quantization. International Journal of Applied Mathematics, 31(4) (2018), 549-585. show that complex ideal lattices obtained from the complex relative embedding (4.2) of ideals from ℤ[ζ 2 s] are isomorphic to a scaled version of the ℤ[i]n -lattice. In this section we show that the complex ideal lattices Λk obtained through the ideals ℑk , where k{0,,n-1}, from ℤ[ζ 2 s] are isomorphic to (1-i)k[i]n and are a scaled version of ℤ[i]n , that is, det(Λk)=2k since the Gram matrix of (1-i)k[i]n is 2k Id.

By Proposition 3.2, since α=1-ζ2s, we have N(ζ2s)/(1-ζ2s)=2. For each k{0,1,,n-1}, we have the element α=(1-ζ2s)k, then the Gram matrix G k associated with complex ideal lattice Λk is Gk=MkMk¯t, where M k is the generator matrix associated with Λk which is given by

M k = α α ζ 2 s α ζ 2 s n - 1 σ 2 ( α ) σ 2 ( α ζ 2 s ) σ 2 ( α ζ 2 s n - 1 ) σ n ( α ) σ n ( α ζ 2 s ) σ n ( α ζ 2 s n - 1 ) .

The matrix M k can also be written as M.UkM¯tUk¯t, where M denotes the generator matrix of the complex lattice Λ[i]n and Uk=dig(σ0((1-ζ2s)k),,σn-1((1-ζ2s)k).

Proposition 4.5.Each complex ideal lattice Λk associated with the ideal(1-ζ2s)k[ζ2s]is a scaled version of the ℤ[i]n -lattice, i.e., Λk is isomorphic to a binary complex lattice(1-i)k[i]n, fork{0,,n-1}.

Proof. Let α=1-ζ2s and let {α,αζ2s,,αζ2sn-1} be a ℤ[i]-basis of the complex ideal lattice Λk . Now consider the Gram matrix G k associated with Λk . Therefore we have

M k M k t ¯ = i = 0 n - 1 σ i ( α ) σ i ( α ) ¯ i = 1 n σ i ( α ) σ i ( α ζ 2 s n - 1 ) ¯ i = 0 n - 1 σ i ( α ) σ i ( α ) ¯ i = 1 n σ i ( α ) σ i ( α ζ 2 s n - 1 ) ¯ , (4.5)

where M k is the generator matrix of the complex ideal lattice Λk .

It follows that the Gram matrix G k can be written as

G k = M k M k ¯ t = i = 0 n - 1 σ i ( α k ) M i = 0 N - 1 σ i ( α k ) ¯ M ¯ t = σ i ( α k ) σ i ( α k ) ¯ M M ¯ t , (4.6)

where M is the generator matrix of the lattice Λ[i]n. Consequently, by using the property of the relative norm, we have N(ζ2s)/(i)(αk)=(1-i)k and N(ζ2s)/(i)(αk¯)=(1-i)k. Then, we obtain

G k = M k M k ¯ t = ( 1 - i ) k ( 1 - i ) ¯ k M M ¯ t . (4.7)

Thenceforward we know that M denotes the generator matrix of the complex ideal lattice Λ[i]n. Then we can conclude from equation (4.7) that Mk=(1-i)kM represents a generator matrix of the complex ideal lattice Λk=(1-i)k[i]n. □

Notice that the Gram matrix G k given by equation (4.7) can be written as Gk=2kId, where Id denotes the identity matrix of order n. Therefore we conclude that all complex ideal lattices Λk , where k{0,,n-1}, are a scaled version of the ℤ[i]n -lattice.

Remark 4.6.Notice that the complex homomorphisms in (4.2) and Propositions 4.3 and 4.5 establish a isomorphism between the idealIk=(1-ζ2s-1)k[ζ2s]and the complex ideal latticeΛk(1-i)k[i]n, that is,σ([ζ2s])=Λ=[i]nandσ(Ik)=Λk, k{1,,n-1}. In this case we obtain a correspondence between the chain of ideals given by equation (4.8)

I n - 1 I n - 2 I [ ζ 2 s ] , (4.8)

whereIk=(1-ζ2s-1)k[ζ2s], and the chain of complex ideal lattices given by equation (4.9)

Λ n - 1 Λ n - 2 Λ 2 Λ 1 Λ = [ i ] n , (4.9)

where Λ k ( 1 - i ) k [ i ] n , for all k { 1 , , n - 1 } .

5 LATTICE CODES OBTAINED IN ℂN FROM THE POLYNOMIAL RING F2[x]/(1-xn) AND THE GENERALIZED POLYNOMIAL RING F2[x,120]((1-x12)2n)

In this section we propose an algebraic / geometrical procedure to the construction of lattice codes in ℂn via cyclic codes characterized by ideals generated by binary polynomials (1-x)k from the polynomial ring F2[x]/(1-xn) in ℂn and via cyclic codes characterized by ideals generated by generalized polynomials (1-x12)k from the generalized polynomial ring F2[x,120]((1-x12)2n) in ℂn . For that, we make use of algebraic tools from the algebraic number theory.

5.1 Binary cyclic codes from quotient rings

This section is started by describing an algebraic procedure which establishes an isomorphism between the binary cyclic codes 𝒞 k characterized by the ideals generated by the polynomials (1-x)k from the polynomial ring F2[x]/(1-xn) which are described by the following chain of ideals in (5.1)

( 1 - x ) n - 1 ( 1 - x ) n - 2 ( 1 - x ) F 2 [ x ] / ( 1 - x n ) (5.1)

and the quotients of lattices of the form Λk/(1-i)Λk, where Λk denotes the lattice of the chain described in 4.9 of the Remark 4.6 and it is the complex ideal lattice (1-i)k[i].

For that we use a result from group theory which is very important for the development of the algebraic procedure that we propose in this section. If G 2 is a subgroup of a group G 1, then the group G 1 can be written as it follows

G 1 = G 2 + G 1 / G 2 , (5.2)

where G1/G2 denotes the quotient group of G 1 by G 2.

As 1+i is equal to 1i due to the product of invertible elements from ℤ[i], then, for convenience, we identify the nested complex ideal lattices Λk ’s module 1i by binary lattice codes proposed by Forney 55 G.D. Forney. Coset Codes - Part I: Introduction and Geometrical Classification. IEEE Transactions on Information Theory , 34(5) (1988), 1123-1151. which are characterized by an ideal of the ring F2[x]/(1-xn). Consequently such binary lattice codes are also characterized by an ideal of the ring F2[x,120]((x12)2n-1).

Proposition 5.1.The complex lattice Λ = ℤ[i]n can be written asΛ=(1-i)Λ+C0, whereC0=(n,n)is the universal binary linear code which is characterized by the polynomial ringF2[x]/(1-xn).

Proof. From Remark 3.3 it follows that the ideal (1-i)[ζ2s] from the ring ℤ[ζ2 s] is a subgroup of ℤ[ζ2 s]. From equation 5.2, we have

[ ζ 2 s ] = ( 1 - i ) [ ζ 2 s ] + [ ζ 2 s ] / ( 1 - i ) [ ζ 2 s ] . (5.3)

From Remark 4.6 and making use of the complex homomorphism 4.2 over the rings ℤ[ζ2 s] and (1-i)[ζ2s], then it follows equation 5.4:

Λ = ( 1 - i ) Λ + Λ / ( 1 - i ) Λ , (5.4)

where Λ = ℤ[i]n.

Now we show that the quotient lattice Λ/(1-i)Λ is isomorphic to the universal binary linear code 𝒞0 which is characterized by the polynomial ring F2[x]/(1-xn). Equations 5.3 and 5.4 are equal due to the complex isomorphism σ in (4.2). Therefore we use equation 5.3 to establish an isomorphism between Λ/(1-i)Λ and the polynomial ring F2[x]/(1-xn). For that, let v=a0+a1ζ2s++an-1ζ2sn-1[ζ2s]. Since ak[i], with k=0,1,,n-1, then we can write each term a k as ak=(1+i)bk+ck, where bk,ck[i] and N(i)/(ck)1. Consequently ck=0,±1,±i. Thenceforth,

v = ( ( 1 - i ) b 0 + c 0 ) + ( ( 1 - i ) b 1 + c 1 ) ζ 2 s + + ( ( 1 - i ) b n - 1 + c n - 1 ) ζ 2 s n - 1 = = [ ( 1 - i ) b 0 + ( 1 - i ) b 1 ζ 2 s + + ( 1 - i ) b n - 1 ζ 2 s n - 1 ] + [ c 0 + c 1 ζ 2 s + + + c n - 1 ζ 2 s n - 1 ] = ( 1 - i ) ( b 0 + b 1 ζ 2 s + + b n - 1 ζ 2 s n - 1 ) + ( c 0 + c 1 ζ 2 s + + c n - 1 ζ 2 s n - 1 ) .

By denoting w=(1-i)(b0+b1ζ2s++bn-1ζ2sn-1) and considering u as it follows

u = c 0 + c 1 ζ 2 s + + c n - 1 ζ 2 s n - 1 , (5.5)

then w(1-i)[ζ2s] and u[ζ2s]/(1-i)[ζ2s].

Now we show that [[ζ2s/(1-i)[ζ2s]C0, that is,

v - w = u r 0 + r 1 x + + r n - 1 x n - 1 F 2 [ x ] / ( 1 - x n ) .

Since [i]/(1-i)[i] is isomorphic to the binary field F2={0,1}, then in ℤ[i] we have the following congruences

( 1 - i ) 0 m o d ( 1 - i ) , ± i 1 m o d ( 1 - i ) and ± 1 1 m o d ( 1 - i ) . (5.6)

Consequently, consider

ϵ : [ ζ 2 s ] / ( 1 - i ) [ ζ 2 s ] F 2 [ x ] / ( 1 - x n ) , (5.7)

where ϵ(u)=ϵ(c0+c1ζ2s++cn-1ζ2sn-1)=k=0n-1(ck mod (1-i))xk=r0+r1x++rn-1xn-1F2[x]/(1-xn), with ck mod (1-i)=rkF2. The application ε is an isomorphism. In fact, let u=k=0n-1ckζ2sk and u'=k=0n-1ck'ζ2sk elements from ℤ[ζ2 s], then ϵ(u+u')=ϵ([k=0n-1ckζ2sk]+[k=0n-1ck'ζ2sk])=ϵ(k=0n-1(ck+ck')ζ2sk)=k=0n-1((ck+ck') mod (1-i))ζ2sk=k=0n-1(ck mod (1-i))ζ2sk+k=0n-1(ck' mod (1-i))ζ2sk=ϵ(k=0n-1ckζ2sk))+ϵ(k=0n-1ck'ζ2sk). Besides, analogously, since ck mod (1-i)=rkF2, we have that ε preserves the corresponding multiplication of the rings. Thenceforward ε is an homomorphism between [ζ2s]/(1-i)[ζ2s] and F2[x]/(1-xn).

Let k=0n-1ckζ2sk and k=0n-1ck'ζ2sk[ζ2s]/(1-i)[ζ2s] such that

ϵ ( k = 0 n - 1 c k ζ 2 s k ) = ϵ ( k = 0 n - 1 c k ' ζ 2 s k ) .

If ϵ(k=0n-1ckζ2sk)=r0+r1x++rn-1xn-1 and ϵ(k=0n-1ck'ζ2sk)=r0'+r1'x++rn-1'xn-1, then r k = r’ k , for all k{0,,n-1}. Therefore ck=ck' mod (1-i), for all k{0,,n-1}, that is, c k = c’ k in [i]/(1-i)[i]. Consequently ε is injective.

Now if r0+r1x++rn-1xn-1F2[x]/(1-xn), then there exists c0+c1ζ2s++cn-1ζ2sn-1[ζ2s]/(1-i)[ζ2s] such that ϵ(c0+c1ζ2s++cn-1ζ2sn-1)=r0+r1x++rn-1xn-1. In fact, if ri=0F2, then we have a corresponding ci=0 mod (1-i)[i] and, if ri=1F2, then we also have a corresponding ci=1 mod (1-i)[i]. Note that −1 and ±i[i] are equal to 1 modulo (1 − i). Therefore ε establishes an isomorphism between [ζ2s]/(1-i)[ζ2s] and F2[x]/(1-xn). □

Proposition 5.2.The latticeΛk=(1-i)k[i]n, wherek=0,1,,n-1, can be written asΛk=(1-i)Λk+Ck, where 𝒞kis the linear binary code characterized by the ideal(1-x)kF2[x]/(1-xn)from the polynomial ringF2[x]/(1-xn).

Proof. Analogously to the proof of the Proposition 5.1, it follows that the ideal ℑk from the ring ℤ[ζ2 s] can be written as

I k = ( 1 - i ) I k + I k / ( 1 - i ) I k . (5.8)

From Remark (4.6), by applying the complex homomorphism σ from 4.2 on the rings ℑk and (1-i)Ik, we have

Λ k = ( 1 - i ) Λ k + Λ k / ( 1 - i ) Λ k . (5.9)

Now we show that the quotient lattice Λk/(1-i)Λk is isomorphic to the linear binary code 𝒞 k which is characterized by the ideal (1-x)kF2[x]/(1-xn) from the polynomial ring F2[x]/(1-xn). Equations (5.8) and (5.9) are equal due to the complex isomorphism σ from (4.2). Therefore we use equation (5.8) to establish an isomorphism between Λk/(1-i)Λk and the ideal (1-x)kF2[x]/(1-xn) from the polynomial ring F2[x]/(1-xn). For that, let v=(1-ζ2s)k(a0+a1ζ2s++an-1ζ2sn-1)Ik=(1-ζ2s)k[ζ2s].

Since ak[i], where k=0,1,,n-1, it follows that each term a k can be written as ak=(1-i)bk+ck, where bk,ck[i] and N(i)/(ck)1. Consequently ck=0,±1,±i and

v = ( 1 - ζ 2 s ) k [ ( ( 1 - i ) b 0 + c 0 ) + ( ( 1 - i ) b 1 + c 1 ) ζ 2 s + + ( ( 1 - i ) b n - 1 + + c n - 1 ) ζ 2 s n - 1 ] = ( 1 - ζ 2 s ) k [ ( 1 - i ) b 0 + ( 1 - i ) b 1 ζ 2 s + + ( 1 - i ) b n - 1 ζ 2 s n - 1 ] + + ( 1 - ζ 2 s ) k [ c 0 + c 1 ζ 2 s + + c n - 1 ζ 2 s n - 1 ] = = ( 1 - ζ 2 s ) k ( 1 - i ) ( b 0 + b 1 ζ 2 s + + b n - 1 ζ 2 s n - 1 ) + + ( 1 - ζ 2 s ) k ( c 0 + c 1 ζ 2 s + + c n - 1 ζ 2 s n - 1 ) .

By denoting w=(1-ζ2s)k(1-i)(b0+b1ζ2s++bn-1ζ2sn-1) and considering u as it follows

u = ( 1 - ζ 2 s ) k ( c 0 + c 1 ζ 2 s + + c n - 1 ζ 2 s n - 1 ) , (5.10)

then w(1-i)Ik and uIk/(1-i)Ik.

Now we show that Ik/(1-i)IkCk, that is,

v - w = u ( 1 - x k ) ( r 0 + r 1 x + + r n - 1 x n - 1 ) ( 1 - x ) k F 2 [ x ] / ( 1 - x n ) .

For that, consider the map

ϵ k : I k / ( 1 - i ) I k ( 1 - x ) k F 2 [ x ] / ( 1 - x n ) (5.11)

given by ϵk(u)=ϵk((1-ζ2s)k(c0+c1ζ2s++cn-1ζ2sn-1))=(1-x)kk=0n-1(ck mod (1-i))xk=(1-x)k(r0+r1x++rn-1xn-1)(1-x)kF2[x]/(1-xn).

Let u=(1-ζ2s)kk=0n-1ckζ2sk and u'=(1-ζ2s)kk=0n-1ck'ζ2sk elements from Ik/(1-i)Ik, then ϵk(u+u')=ϵ([(1-ζ2s)kk=0n-1ckζ2sk]+[(1-ζ2s)kk=0n-1ck'ζ2sk)])=ϵk((1-ζ2s)kk=0n-1(ck+ck')ζ2sk)=(1-x)kk=0n-1((ck+ck') mod (1-i))ζ2sk=(1-x)kk=0n-1(ck mod (1-i))ζ2sk+(1-x)kk=0n-1(ck' mod (1-i))ζ2sk=ϵk((1-ζ2s)kk=0n-1ckζ2sk))+ϵk((1-ζ2s)kk=0n-1ck'(ζ2sk)). Besides, analogously, since ck mod (1-i)=rkF2, we have that ε preserves the corresponding multiplication of the rings. Thenceforward ε k is an homomorphism between Ik/(1-i)Ik and (1-x)kF2[x]/(1-xn).

Now let (1-ζ2s)kk=0n-1ckζ2sk and (1-ζ2s)kk=0n-1ck'ζ2skIk/(1-i)Ik such that

ϵ k ( ( 1 - ζ 2 s ) k k = 0 n - 1 c k ζ 2 s k ) = ϵ k ( ( 1 - ζ 2 s ) k k = 0 n - 1 c k ' ζ 2 s k ) .

If ϵk((1-ζ2s)kk=0n-1ckζ2sk)=(1-x)k(r0+r1x++rn-1xn-1) and ϵk((1-ζ2s)kk=0n-1ck'ζ2sk)=(1-x)k(r0'+r1'x++rn-1'xn-1), then r k = r’ k , for all k{0,,n-1}. Therefore ck=ck' mod (1-i), for all k{0,,n-1}, that is, c k = c k in [i]/(1-i)[i]. Consequently ε k is injective.

Now if (1-x)k(r0+r1x++rn-1xn-1)(1-x)kF2[x]/(1-xn), then there exists (1-ζ2s)k(c0+c1ζ2s++cn-1ζ2sn-1)[Ik/(1-i)Ik] such that ϵk((1-ζ2s)k(c0+c1ζ2s++cn-1ζ2sn-1))=(1-x)k(r0+r1x++rn-1xn-1) If fact, if ri=0F2 then we have a corresponding ci=0 mod (1-i)[i] and, if ri=1F2, then we also have a corresponding ci=1 mod (1-i)[i]. Note that −1 and ±i[i] are equal to 1 modulo (1 − i). Therefore ε k establishes an isomorphism between the code 𝒞 k and the quotient ring Ik/(1-i)Ik. □

Now we establish an isomorphism between the binary cyclic codes 𝒞’ k , where k=0,1,,n-1, which are characterized, respectively, by the ideals (1-x12)k from the generalized polynomial ring F2[x;120]/(1-x12)2n and the quotient lattices Λk/(1-i)Λk, where Λk is the complex lattice from the chain of nested complex lattices which is given in (4.9).

Next we have the corresponding chain of the ideals (1-x12)k from the generalized polynomial ring F2[x;120]/(1-x12)2n:

( 1 - x 1 2 ) n - 1 ( 1 - x 1 2 ) n - 2 ( 1 - x 1 2 ) F 2 [ x ; 1 2 0 ] / ( 1 - x 1 2 ) 2 n . (5.12)

Therefore we make use of the following remark to stablish such an isomorphism.

Remark 5.3.By considering the change of variabley=x12, then

  • (i)There exists an identification between the elements ofF2[y]/(1-y)nandF2[x;120]/(1-x12)2n . In fact, ifu=a0+a1y++an-1yn-1F2[y]/(1-y)2n , then the corresponding identification can be given byh(a0+a1y++an-1yn-1)=a0'+a12'x12++an-12(x12)n-1F2[x;120]/(1-x12)2n , whereak=ak2'F2for allk{0,1,,n-1} .

  • (ii)there is an identification between the ideals(1-y)kF2[y]/(1-y)nfrom the polynomial ringF2[y]/(1-y)nand the ideals(1-x12)kF2[x;120]/(1-x12)2nfrom the generalized polynomial ringF2[x;120]/(1-x12)2n . In fact, ifu=(1-y)k(a0+a1y++an-1yn-1)(1-y)kF2[y]/(1-y)n , then the corresponding identification can be given byh((1-y)k(a0+a1y++an-1yn-1))=(1-x12)k(a0'+a12'x12++an-12(x12)n-1)F2[x;120]/(1-x12)2n , whereak=ak2'F2for allk{0,1,,n-1} .

Proposition 5.4.The complex lattice Λ = ℤ[i]n can be written asΛ=(1-i)Λ+C0', whereC0'=(n,n)is the universal binary code characterized by the generalized polynomial ringF2[x;120]/(1-x12)2n.

Proof. This proof is analogous to the proof of the Proposition 5.1, then we make use of the equations (5.3) and (5.4). Consequently it is necessary to show that the corresponding quotient lattice Λ/(1-i)Λ is isomorphic to the code 𝒞’ 0 which is characterized by the generalized polynomial ring F2[x;120]/(1-x12)2n.

Since equations (5.3) and (5.4) are equal due to the complex isomorphism σ from (4.2), then we consider equation (5.3) to establish an isomorphism between Λ/(1-i)Λ and the generalized polynomial ring F2[x;120]/(1-x12)2n.

Note that [ζ2s]=(1-ζ2s)n[ζ2s]+[ζ2s]/(1-ζ2s)n[ζ2s]. From Proposition 5.1, equation (5.5), each element u[ζ2s]/(1-ζ2s)n[ζ2s] is written as

u = c 0 + c 1 ζ 2 s + + c n - 1 ζ 2 s n - 1 , (5.13)

where ck[i] and N(i)/(ck)1. Consequently ck=0,±1,±i. Now we show that [[ζ2s]/(1-i)[ζ2s]C0', where C0'=(n,n) is the universal binary code characterized by the generalized polynomial ring F2[x;120]/(1-x12)2n. By using the polynomial ring over the binary field 𝔽2 described as F2[y]/(1-yn) through Remark 5.3, item (i), from Proposition 5.1, it follows that the map

ϵ : [ ζ 2 s ] / ( 1 - i ) [ ζ 2 s ] F 2 [ y ] / ( 1 - y n ) (5.14)

which is given by ϵ(u)=ϵ(c0+c1ζ2s++cn-1ζ2sn-1)=k=0n-1(ck mod (1-i))xk=r0+r1x++rn-1xn-1F2[y]/(1-yn), where ck mod (1-i)=rkF2, is an isomorphism between [ζ2s]/(1-i)[ζ2s] and F2[y]/(1-yn). Now, from equation (3.5), the 2s -th root of unity can be written as ζ2s=ζ2s-112, thenceforth, each element u=c0+c1ζ2s++cn-1ζ2sn-1[ζ2s]/(1-i)[ζ2s] can be written as u=d0+d12ζ2s-112++dn-12(ζ2s-112)n-1 and, consequently, c k = d k/2 , for all k=0,,n-1. Also by considering the change of variable y=x12 from Remark 5.3, it follows that the isomorphism ε from (5.14) can be written as

ϵ ' : [ ζ 2 s ] / ( 1 - i ) [ ζ 2 s ] F 2 [ x ; 1 2 0 ] / ( 1 - x 1 2 ) 2 n , (5.15)

where ϵ'(u)=ϵ(d0+d12ζ2s-112++dn-12(ζ2s-112)n-1)=k=0n-1(dk/2 mod (1-i))(x12)k=t0+t12(x12)++tn-12(x12)n-1F2[x;120]/(1-x12)n, wich ck mod (1-i)=tk2F2 and c k = d k/2 for all k=0,1,,n-1. Thenceforward [[ζ2s]/(1-i)[ζ2s] and F2[x;120]/(1-x12)2n are isomorphic, then the proof is concluded. □

Proposition 5.5.The latticeΛk=(1-i)k[i]nwhich is a scaled version of the ℤ[i]n -lattice can be written asΛk=(1-i)Λk+Ck', where 𝒞’ k is the code characterized by the ideal(1-x12)kF2[x;120]/(1-x12)nfrom the generalized polynomial ringF2[x;120]/(1-x12)2n.

Proof. It is necessary to show that the quotient lattice Λk/(1-i)Λk is isomorphic to the code 𝒞’ k characterized by the ideal (1-x12)kF2[x;120]/(1-x12)2n from the generalized polynomial ring F2[x;120]/(1-x12)2n.

Since equations (5.8) and (5.9) are equal due to the complex isomorphism σ from 4.2, then we consider equation (5.8) to establish an isomorphism between Λk/(1-i)Λk and the ideal (1-x12)kF2[x;120]/(1-x12)2n from the generalized polynomial ring F2[x;120]/(1-x12)2n. For that, let v=(1-ζ2s)k(a0+a1ζ2s++an-1ζ2sn-1)Ik=(1-ζ2s)k[ζ2s].

Since ak[i], where k=0,1,,n-1, then each term a k is given by ak=(1-i)bk+ck, where bk,ck[i] and N(i)/(ck)1. Consequently ck=0,±1,±i and

v = ( 1 - ζ 2 s ) k [ ( ( 1 - i ) b 0 + c 0 ) + ( ( 1 - i ) b 1 + c 1 ) ζ 2 s + + ( ( 1 - i ) b n - 1 + + c n - 1 ) ζ 2 s n - 1 ] = ( 1 - ζ 2 s ) k [ ( 1 - i ) b 0 + ( 1 - i ) b 1 ζ 2 s + + ( 1 - i ) b n - 1 ζ 2 s n - 1 ] + + ( 1 - ζ 2 s ) k [ c 0 + c 1 ζ 2 s + + c n - 1 ζ 2 s n - 1 ] = = ( 1 - ζ 2 s ) k ( 1 - i ) ( b 0 + b 1 ζ 2 s + + b n - 1 ζ 2 s n - 1 ) + + ( 1 - ζ 2 s ) k ( c 0 + c 1 ζ 2 s + + c n - 1 ζ 2 s n - 1 ) .

By denoting w=(1-ζ2s)k(1-i)(b0+b1ζ2s++bn-1ζ2sn-1) and considering u as it follows

u = ( 1 - ζ 2 s ) k ( c 0 + c 1 ζ 2 s + + c n - 1 ζ 2 s n - 1 ) , (5.16)

then w(1-i)Ik and uIk/(1-i)Ik.

Now we show that Ik/(1-i)IkCk', that is,

v - w = u ( 1 - x 1 2 ) k ( t 0 + t 1 2 ( x 1 2 ) + + t n - 1 2 ( x 1 2 ) n - 1 ) ( 1 - x 1 2 ) k F 2 [ x ; 1 2 0 ] / ( 1 - x 1 2 ) 2 n .

By using the polynomial ring over the binary field 𝔽2 described as F2[y]/(1-yn) through Remark 5.3, item (i), from Proposition 5.1, it follows that the map

ϵ k ' : I k / ( 1 - i ) I k ( 1 - y ) k F 2 [ y ] / ( 1 - y n ) (5.17)

which is given by ϵk'(u)=ϵk'((1-ζ2s)k(c0+c1ζ2s++cn-1ζ2sn-1))=(1-y)kk=0n-1(ck mod (1-i))yk=(1-y)k(r0+r1y++rn-1yn-1)(1-y)kF2[y]/(1-yn) establishes an isomorphism between Ik/(1-i)Ik and the ideal (1-y)kF2[y]/(1-yn), where ck mod (1-i)=rkF2, for all k{0,1,,n-1}.

Now, from equation (3.5), the 2s -th root of unity can be written as ζ2s=ζ2s-112, thenceforth, each element u=(1-ζ2s)k(c0+c1ζ2s++cn-1ζ2sn-1)(1-ζ2s)k[ζ2s]/(1-i)(1-ζ2s)k[ζ2s] can be written as u=(1-ζ2s-112)k(d0+d12ζ2s-112++dn-12(ζ2s-112)n-1) and, consequently, c k = d k/2 , for all k=0,1,,n-1. Also by considering the change of variable y=x12 from Remark 5.3, it follows that the isomorphism ε’ k can be written as

ϵ k ' : ( 1 - ζ 2 s ) k [ ζ 2 s ] / ( 1 - i ) ( 1 - ζ 2 s ) k [ ζ 2 s ] ( 1 - x 1 2 ) k F 2 [ x ; 1 2 0 ] / ( 1 - x 1 2 ) 2 n , (5.18)

where ϵk'(u)=ϵ((1-ζ2s-112)k(d0+d12ζ2s-112++dn-12(ζ2s-112)n-1))=(1-x12)kk=0n-1(dk/2 mod (1-i))(x12)k=(1-x12)k(t0+t12(x12)++tn-12(x12)n-1)(1-x12)kF2[x;120]/(1-x12)2n, with dk/2 mod (1-i)=tk/2F2. Thenceforward (1-ζ2s)k[ζ2s]/(1-i)(1-ζ2s)k[ζ2s] and (1-x12)kF2[x;120]/(1-x12)2n are isomorphic, then the proof is concluded. □

Observe that the complex lattice codes 𝒞 k and 𝒞’k, where k=0,1,,n-1, which are characterized, respectively, by the ideals (1-x)kF2[x]/(1-xn) from the polynomial ring F2[x]/(1-xn) and by the ideals (1-x12)kF2[x;120]/(1-x12)2n from the generalized polynomial ring F2[x;120]/(1-x12)2n, are nested codes. Therefore, these codes can be applied to quantize complex-valued channels 1111 C.C. Trinca , J.C. Belfiore , E.D. de Carvalho, J. Vieira Filho, R. Palazzo Jr. & R.A. Watanabe. Construction of Complex Nested Ideal Lattices for Complex-Valued Channel Quantization. International Journal of Applied Mathematics, 31(4) (2018), 549-585. in order to realize interference alignment 99 J. Tang & S. Lambotharan. Interference alignment techniques for MIMO multi-cell interfering broadcast channels. IEEE Transactions on Communications, 61(1) (2013), 164-175.. Besides, since these codes are constructed by using ideals from the rings F2[x]/(1-xn) and F2[x;120]/(1-x12)2n, respectively, then it is obtained the multiplication structure 88 F. Oggier & J.C. Belfiore. Enabling multiplication in lattice codes via Construction A. In “2013 IEEE Information Theory Workshop (ITW)”, volume 1. IEEE (2013), p. 1-5. which can be applied to nonlinear distributed computing over a wireless network.

Acknowledgements

This work has been supported by the following Brazilian Agencies: CAPES (Coordenação de Aperfeiçoamento de Pessoal de Nível Superior) under grant No. 6562-10-8 and FAPESP (Fundação de Amparo à Pesquisa do Estado de São Paulo) under grant No. 2013/25977-7.

REFERENCES

  • 1
    T.S. Amanullah & A.A. de Andrade. A Decoding Procedure which Improves Code Rate and Error Corrections. Journal of Advanced Research in Applied Mathematics, 4(4) (2012), 37-50.
  • 2
    J. Boutros & E. Viterbo. Signal space diversity: a power-and bandwidth-efficient diversity technique for the Rayleigh fading channel. IEEE Transactions on Information Theory, 44(4) (1998), 1453-1467.
  • 3
    J.H. Conway & N.J.A. Sloane. “Sphere Packings, Lattices and Groups”. Springer-Verlag, New York (1988).
  • 4
    A.A. de Andrade & R.P. Junior. Linear codes over finite rings. Tendências em Matemática Aplicada e Computacional (TEMA), 6(2) (2005), 207-217.
  • 5
    G.D. Forney. Coset Codes - Part I: Introduction and Geometrical Classification. IEEE Transactions on Information Theory , 34(5) (1988), 1123-1151.
  • 6
    G.D. Forney . Coset Codes - Part II: binary lattices and related codes. IEEE Transactions on Information Theory , 34(5) (1988), 1152-1187.
  • 7
    F. Oggier. “Algebraic methods for channel coding”. Ph.D. thesis, École Polytechnique Fédérale de Lausanne, Lausanne (2005). PhD Thesis.
  • 8
    F. Oggier & J.C. Belfiore. Enabling multiplication in lattice codes via Construction A. In “2013 IEEE Information Theory Workshop (ITW)”, volume 1. IEEE (2013), p. 1-5.
  • 9
    J. Tang & S. Lambotharan. Interference alignment techniques for MIMO multi-cell interfering broadcast channels. IEEE Transactions on Communications, 61(1) (2013), 164-175.
  • 10
    C.C. Trinca. “A contribuition to the study of channel coding in wireless communication systems”. Ph.D. thesis, Universidade Estadual Paulista (UNESP), Ilha Solteira, SP (2013). PhD Thesis.
  • 11
    C.C. Trinca , J.C. Belfiore , E.D. de Carvalho, J. Vieira Filho, R. Palazzo Jr. & R.A. Watanabe. Construction of Complex Nested Ideal Lattices for Complex-Valued Channel Quantization. International Journal of Applied Mathematics, 31(4) (2018), 549-585.
  • 12
    E.B. X. Giraud & J.C. Belfiore . Algebraic tools to build modulation schemes for fading channels. IEEE Transactions on Information Theory , 43(3) (1997), 938-952.

Publication Dates

  • Publication in this collection
    04 Apr 2022
  • Date of issue
    Jan-Mar 2022

History

  • Received
    20 May 2021
  • Accepted
    18 June 2021
Sociedade Brasileira de Matemática Aplicada e Computacional - SBMAC Rua Maestro João Seppe, nº. 900, 16º. andar - Sala 163, Cep: 13561-120 - SP / São Carlos - Brasil, +55 (16) 3412-9752 - São Carlos - SP - Brazil
E-mail: sbmac@sbmac.org.br