ABSTRACT
Through algebraic number theory and Construction A we extend an algebraic procedure which generates nested complex lattice codes from the polynomial ring , where , by using ideals from the generalized polynomial ring through the ring of integers 𝒪𝕃 of the cyclotomic field , where 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)
and a chain of nested complex lattices given by equation (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 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 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 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 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 to the monoid ring .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 and the monoid ring 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 on the Galois extension of degree n = 2s−2 , we establish a general correspondence between the sequence of the ideals , where , 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 is the algebraic ring of integer of the number field and 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 . In the second one we rewrite the -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 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: and , where the symbol indicates that the sum is taken over all the pairs (t u) of elements from S such that . Whenever s cannot be written on the form , with , then it is settled that .
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 or as .
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 , where and , for , 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 is the canonical form of the nonzero element , where s 1 < s 2 < · · · < s n , then s n is called the degree of f and we denote it by . Analogously, the order of f is defined and denoted by . Now, if ℛ is an integral domain, then, for , it follows that and . 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, 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 , every cyclic shift , where , for .
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 ofis a cyclic code if and only if C is an ideal of ℜ.
If is a monic pseudo polynomial of degree n, then is the set of residue classes of pseudo polynomials in module the ideal and a class can be represented as .
Let , 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.,
Proof. Over the polynomial ring 𝔽2[x], it follows that . In fact, from Newton’s binomial theorem for , it follows that
Since n = 2s and the coefficients are in 𝔽2, then it follows that (observe that ). Therefore the polynomial x n − 1 can be written as
□
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 , where 𝔽2 is the binary field, then we have the following result.
Proposition 2.3.The generalized polynomialis factored in the generalized polynomial ringas the product of 2n generalized monomials of the form, i.e.,
Proof. Analogously to the proof of Proposition 2.2, it follows that
which proves the result. □
It is provided from Equation (2.3) that the generalized polynomial has 22n divisors in . Then there are 22n cyclic codes generated by the generalized polynomials which divide the generalized polynomial in the generalized polynomial ring .
3 RESULTS FROM ALGEBRAIC NUMBER THEORY
Let 𝔽 and 𝕃 be fields such that . 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 . 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 is called an algebraic integer if there is a monic polynomial such that p(w) = 0. The set
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 can be uniquely written as , where , for all i = 1, 2,· · · , n.
Example 3.1. Let 𝕃 a cyclotomic field given by, with, where ζ2 s is a primitive 2s -th root of unity. Furthermore:
-
1. This extension field is a Galois extension with
-
-
which is a cyclic multiplicative group of order . The function φ is called Euler function;
-
2. We denote the ring of integers of 𝕃 byand its integral basis is given by .
Let and denoted by 𝕃s−1 and 𝕃s , respectively. Consequently we have . Thenceforward we obtain the following tower of finite extension fields
where and . Also the minimal polynomial of ζ2 s over ℤ[i] has degree and it is given by
From there the 2s−2 distinct ℚ(i)-homomorphisms are denoted by σ i , where , and , for all .
If 𝕃 is an algebraic number field of degree n, then the trace and the norm of an element are defined as the numbers and , respectively. Furthermore:
-
1. If 𝕃/𝕂/ℚ is a tower of finite extension fields, then, for each , it follows that
-
2. If , then
Let {w0, w1,··· , wN−1} be an integral basis of 𝒪𝕃 and let ℑ be an ideal of 𝒪𝕃. The norm of ℑ is defined by , i.e., it is the cardinality of the quotient ring 𝒪𝕃/ℑ. If ζ2 s is a 2s -th root of unity, then or, equivalently,
Lemma 3.1.If, then.
Proof. The finite extension field has degree 2. Consequently, we can see ℚ(ζ2 s) as a field extension of the field whose minimal polynomial is given by and the Galois group is given by , where and . Therefore, . □
Proposition 3.2.If, then.
Proof. If s = 3, then . By Lemma 3.1, we have that . Now we consider an induction over s − 1, that is, suppose that . By using the fact that the property of relative norm on finite extensions is transitive, we have
By Lemma 3.1, it follows that . Thus, by using induction over s − 1, we have that . □
Remark 3.3.Since, from Proposition 3.2, it follows thatis completely factored as a power of prime ideal in ℤ[ζ2 s] of the form, where
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
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 . 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, .
A subset is called sublattice if Λ’ itself is a lattice, i.e, Λ’ is an additive subgroup of Λ. The sublattice Λ’ can also be characterized as , 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
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 . From an ideal (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:
where , for all .
Remark 4.1.Note that the lattice Λ in ℂn 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 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
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 all.
The field ℚ(ζ 2 s), where , is a CM field, i.e., ℚ(ζ 2 s) is a totally imaginary quadratic extension of , where .
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 latticeis a ℤ[i]-lattice, where ℑ is a ℤ[ζ 2 s]-ideal, b is a bilinear form given by, for all, anddenotes the complex conjugation in ℤ[i].
The matrix
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.Letbe a principal ideal of ℤ[ζ 2 s]. Thenis a complex ideal lattice over ℤ[i], where b is a bilinear form given by, for all, and c is a normalized factor.
Observe that can be written as the product of matrices given by , where M is the matrix related to the relative embedding defined in (4.3) and .
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 , from ℤ[ζ 2 s] are isomorphic to and are a scaled version of ℤ[i]n , that is, since the Gram matrix of is 2k Id.
By Proposition 3.2, since , we have . For each , we have the element , then the Gram matrix G k associated with complex ideal lattice Λk is , where M k is the generator matrix associated with Λk which is given by
The matrix M k can also be written as , where M denotes the generator matrix of the complex lattice and .
Proposition 4.5.Each complex ideal lattice Λk associated with the idealis a scaled version of the ℤ[i]n -lattice, i.e., Λk is isomorphic to a binary complex lattice, for.
Proof. Let and let be a ℤ[i]-basis of the complex ideal lattice Λk . Now consider the Gram matrix G k associated with Λk . Therefore we have
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
where M is the generator matrix of the lattice . Consequently, by using the property of the relative norm, we have and . Then, we obtain
Thenceforward we know that M denotes the generator matrix of the complex ideal lattice . Then we can conclude from equation (4.7) that represents a generator matrix of the complex ideal lattice . □
Notice that the Gram matrix G k given by equation (4.7) can be written as , where Id denotes the identity matrix of order n. Therefore we conclude that all complex ideal lattices Λk , where , 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 idealand the complex ideal lattice, that is,and. In this case we obtain a correspondence between the chain of ideals given by equation (4.8)
where, and the chain of complex ideal lattices given by equation (4.9)
where , for all .
5 LATTICE CODES OBTAINED IN ℂN FROM THE POLYNOMIAL RING AND THE GENERALIZED POLYNOMIAL RING
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 from the polynomial ring in ℂn and via cyclic codes characterized by ideals generated by generalized polynomials from the generalized polynomial ring 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 from the polynomial ring which are described by the following chain of ideals in (5.1)
and the quotients of lattices of the form , where Λk denotes the lattice of the chain described in 4.9 of the Remark 4.6 and it is the complex ideal lattice .
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
where denotes the quotient group of G 1 by G 2.
As is equal to due to the product of invertible elements from ℤ[i], then, for convenience, we identify the nested complex ideal lattices Λk ’s module 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 . Consequently such binary lattice codes are also characterized by an ideal of the ring .
Proposition 5.1.The complex lattice Λ = ℤ[i]n can be written as, whereis the universal binary linear code which is characterized by the polynomial ring.
Proof. From Remark 3.3 it follows that the ideal from the ring ℤ[ζ2 s] is a subgroup of ℤ[ζ2 s]. From equation 5.2, we have
From Remark 4.6 and making use of the complex homomorphism 4.2 over the rings ℤ[ζ2 s] and , then it follows equation 5.4:
where Λ = ℤ[i]n.
Now we show that the quotient lattice is isomorphic to the universal binary linear code 𝒞0 which is characterized by the polynomial ring . 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 and the polynomial ring . For that, let . Since , with , then we can write each term a k as , where and . Consequently . Thenceforth,
By denoting and considering u as it follows
then and .
Now we show that , that is,
Since is isomorphic to the binary field , then in ℤ[i] we have the following congruences
Consequently, consider
where , with . The application ε is an isomorphism. In fact, let and elements from ℤ[ζ2 s], then . Besides, analogously, since , we have that ε preserves the corresponding multiplication of the rings. Thenceforward ε is an homomorphism between and .
Let and such that
If and , then r k = r’ k , for all . Therefore , for all , that is, c k = c’ k in . Consequently ε is injective.
Now if , then there exists such that . In fact, if , then we have a corresponding and, if , then we also have a corresponding . Note that −1 and are equal to 1 modulo (1 − i). Therefore ε establishes an isomorphism between and . □
Proposition 5.2.The lattice, where, can be written as, where 𝒞kis the linear binary code characterized by the idealfrom the polynomial ring.
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
From Remark (4.6), by applying the complex homomorphism σ from 4.2 on the rings ℑk and , we have
Now we show that the quotient lattice is isomorphic to the linear binary code 𝒞 k which is characterized by the ideal from the polynomial ring . 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 and the ideal from the polynomial ring . For that, let .
Since , where , it follows that each term a k can be written as , where and . Consequently and
By denoting and considering u as it follows
then and .
Now we show that , that is,
For that, consider the map
given by .
Let and elements from , then . Besides, analogously, since , we have that ε preserves the corresponding multiplication of the rings. Thenceforward ε k is an homomorphism between and .
Now let and such that
If and , then r k = r’ k , for all . Therefore , for all , that is, c k = c ’ k in . Consequently ε k is injective.
Now if , then there exists such that If fact, if then we have a corresponding and, if , then we also have a corresponding . Note that −1 and are equal to 1 modulo (1 − i). Therefore ε k establishes an isomorphism between the code 𝒞 k and the quotient ring . □
Now we establish an isomorphism between the binary cyclic codes 𝒞’ k , where , which are characterized, respectively, by the ideals from the generalized polynomial ring and the quotient lattices , 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 from the generalized polynomial ring :
Therefore we make use of the following remark to stablish such an isomorphism.
Remark 5.3.By considering the change of variable, then
-
(i)There exists an identification between the elements ofand . In fact, if , then the corresponding identification can be given by , wherefor all .
-
(ii)there is an identification between the idealsfrom the polynomial ringand the idealsfrom the generalized polynomial ring . In fact, if , then the corresponding identification can be given by , wherefor all .
Proposition 5.4.The complex lattice Λ = ℤ[i]n can be written as, whereis the universal binary code characterized by the generalized polynomial ring.
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 is isomorphic to the code 𝒞’ 0 which is characterized by the generalized polynomial ring .
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 and the generalized polynomial ring .
Note that . From Proposition 5.1, equation (5.5), each element is written as
where and . Consequently . Now we show that , where is the universal binary code characterized by the generalized polynomial ring . By using the polynomial ring over the binary field 𝔽2 described as through Remark 5.3, item (i), from Proposition 5.1, it follows that the map
which is given by , where , is an isomorphism between and . Now, from equation (3.5), the 2s -th root of unity can be written as , thenceforth, each element can be written as and, consequently, c k = d k/2 , for all . Also by considering the change of variable from Remark 5.3, it follows that the isomorphism ε from (5.14) can be written as
where , wich and c k = d k/2 for all . Thenceforward and are isomorphic, then the proof is concluded. □
Proposition 5.5.The latticewhich is a scaled version of the ℤ[i]n -lattice can be written as, where 𝒞’ k is the code characterized by the idealfrom the generalized polynomial ring.
Proof. It is necessary to show that the quotient lattice is isomorphic to the code 𝒞’ k characterized by the ideal from the generalized polynomial ring .
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 and the ideal from the generalized polynomial ring . For that, let .
Since , where , then each term a k is given by , where and . Consequently and
By denoting and considering u as it follows
then and .
Now we show that , that is,
By using the polynomial ring over the binary field 𝔽2 described as through Remark 5.3, item (i), from Proposition 5.1, it follows that the map
which is given by establishes an isomorphism between and the ideal , where , for all .
Now, from equation (3.5), the 2s -th root of unity can be written as , thenceforth, each element can be written as and, consequently, c k = d k/2 , for all . Also by considering the change of variable from Remark 5.3, it follows that the isomorphism ε’ k can be written as
where , with . Thenceforward and are isomorphic, then the proof is concluded. □
Observe that the complex lattice codes 𝒞 k and 𝒞’k, where , which are characterized, respectively, by the ideals from the polynomial ring and by the ideals from the generalized polynomial ring , 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 and , 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
-
1T.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.
-
2J. 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.
-
3J.H. Conway & N.J.A. Sloane. “Sphere Packings, Lattices and Groups”. Springer-Verlag, New York (1988).
-
4A.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.
-
5G.D. Forney. Coset Codes - Part I: Introduction and Geometrical Classification. IEEE Transactions on Information Theory , 34(5) (1988), 1123-1151.
-
6G.D. Forney . Coset Codes - Part II: binary lattices and related codes. IEEE Transactions on Information Theory , 34(5) (1988), 1152-1187.
-
7F. Oggier. “Algebraic methods for channel coding”. Ph.D. thesis, École Polytechnique Fédérale de Lausanne, Lausanne (2005). PhD Thesis.
-
8F. 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.
-
9J. Tang & S. Lambotharan. Interference alignment techniques for MIMO multi-cell interfering broadcast channels. IEEE Transactions on Communications, 61(1) (2013), 164-175.
-
10C.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.
-
11C.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.
-
12E.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