Open access peer-reviewed chapter

Z2Z2[u]-Linear and Z2Z2[u]-Cyclic Codes

Written By

Ismail Aydogdu

Submitted: 18 January 2019 Reviewed: 10 April 2019 Published: 23 October 2019

DOI: 10.5772/intechopen.86281

From the Edited Volume

Coding Theory

Edited by Sudhakar Radhakrishnan and Muhammad Sarfraz

Chapter metrics overview

705 Chapter Downloads

View Full Metrics

Abstract

Additive codes were first introduced by Delsarte in 1973 as subgroups of the underlying abelian group in a translation association scheme. In the case where the association scheme is the Hamming scheme, that is, when the underlying abelian group is of order 2 n , the additive codes are of the form Z 2 α × Z 4 β with α + 2 β = n . In 2010, Borges et al. introduced Z 2 Z 4 -additive codes which they defined them as the subgroups of Z 2 α × Z 4 β . In this chapter we introduce Z 2 Z 2[u]-linear and Z 2 Z 2[u]-cyclic codes where Z 2 = 0 1 is the binary field and Z 2 u = 0 1 u 1 + u is the ring with four elements and u 2 = 0 . We give the standard forms of the generator and parity-check matrices of Z 2 Z 2[u]-linear codes. Further, we determine the generator polynomials for Z 2 Z 2 u -linear cyclic codes. We also present some examples of Z 2 Z 2[u]-linear and Z 2 Z 2[u]-cyclic codes.

Keywords

  • Z2Z2[u]-linear codes
  • cyclic codes
  • generator matrix
  • duality
  • parity-check matrix
  • minimal spanning set

1. Introduction

In coding theory, the most important class of error-correcting codes is the family of linear codes, because the encoding and decoding procedures for a linear code are faster and simpler than those for arbitrary nonlinear codes. Many practically important linear codes have also an efficient decoding. Specifically, a linear code C of length n is a vector subspace of F q n , where F q is a finite field with q elements. Among all the codes over finite fields, binary linear codes (linear codes over F 2 ) have a very special and important place because of their easy implementations and applications. In the beginning, researchers were mainly studying on linear codes over fields, especially binary fields. However, in 1994, a remarkable paper written by Hammons et al. [1] brought a new direction to studies on coding theory. In this paper, they showed that some well-known nonlinear codes, the Nordstrom-Robinson code, Kerdock codes, and Delsarte-Goethals code, are actually binary images of some linear codes over the ring of integers modulo, 4, i.e., Z 4. Such connections motivate the researchers to study on codes over different rings even over other structural algebras such as groups or modules. Even though the structure of binary linear codes and quaternary linear codes (codes over F 4 or Z 4) have been studied in details for the last 50 years, recently, in 2010, a new class of error-correcting codes over the ring Z 2 α × Z 4 β called additive codes that generalizes the class of binary linear codes and the class of quaternary linear codes have been introduced by Borges et al. in [2]. A Z 2 Z 4-additive code C is defined as a subgroup of Z 2 α × Z 4 β , where α and β are positive integers and α + 2 β = n . Despite the fact that Z 2 Z 4-additive codes are a new type of codes, they have shown to have some applications in fields such as the field of steganography. Another important ring of four elements which is not isomorphic to Z 4 is the ring Z 2 + u Z 2 = 0 1 u 1 + u = R = Z 2 u where u 2 = 0 . Working with the ring R has some advantages compared to the ring Z 4. For example, the Gray images of linear codes over R are always binary linear codes which is not always the case for Z 4. Further, since the finite field F 2 is a subring of the ring R , the factorization of polynomials over R is the same with the factorization of polynomials over F 2 , so we do not need Hensel’s lift for factorization. Moreover, decoding algorithm of cyclic codes over R is easier than that over Z 4. In this chapter of the book, we introduce Z 2 Z 2 u -linear and Z 2 Z 2 u -cyclic codes. The original study about linear and cyclic codes over Z 2 Z 2 u was done by Aydogdu et al. in [3, 4]. So, this chapter is a survey on Z 2 Z 2 u -linear and Z 2 Z 2 u -cyclic codes which were introduced in [3, 4].

Advertisement

2. Z 2 Z 2[u]-linear codes

Let Z 2 = 0 1 be the finite field and R = Z 2 + u Z 2 = 0 1 u 1 + u , u 2 = 0 be the finite ring of four elements. Since Z 2 is a subring of R , we define the following set:

Z 2 R = c 1 c 2 c 1 Z 2 and c 2 R

This set is not well defined with respect to the usual multiplication by u R . So it is not an R -module. Hence the set Z 2 R cannot be endowed with an algebraic structure directly. Therefore we introduce a new multiplication to make it well defined and enriched with an algebraic structure.

Let d R ; then d can be expressed in the form d = r + uq with r , q Z 2 . We define the following map:

η : R Z 2 η d = r = d ¯

as η 0 = 0 , η 1 = 1 , η u = 0 and η 1 + u = 1 . It is easy to see that the mapping η is a ring homomorphism. Now, using this map we define the following R -scalar multiplication on Z 2 R . For any element d R :

d c 1 c 2 = η d c 1 dc 2 = d ¯ c 1 dc 2

This new multiplication is well defined and also can be extended over Z 2 α × R β as follows. Let d R and v = a 0 a 1 a α 1 b 0 b 1 b β 1 Z 2 α × R β ; then define

dv = η d a 0 η d a 1 η d a α 1 db 0 db 1 db β 1 = d ¯ a 0 d ¯ a 1 d ¯ a α 1 db 0 db 1 db β 1 .

Lemma 2.1. Z 2 α × R β is an R -module with respect to the multiplication defined above.

Definition 2.2. Let C be a non-empty subset of Z 2 α × R β . C is called a Z 2 Z 2 u -linear code if it is an R -submodule of Z 2 α × R β .

Note that the ring R is isomorphic to Z 2 2 as an additive group. Therefore, any Z 2 Z 2 u -linear code C is isomorphic to a group of the form Z 2 k 0 + k 2 × Z 2 2 k 1 , for some k 0 , k 1 , k 2 Z + . Now let us consider the following sets:

C β F = a b Z 2 α × R β b is free over R β

where if b = R β , then b is called free over R β:

C 0 = a ub Z 2 α × R β a 0 C \ C β F
C 1 = a ub Z 2 α × R β a = 0 C \ C β F

Now, denote the dimension of C 0 , C 1 , and C β F as k 0, k 2, and k 1, respectively. Hence, if C Z 2 α × R β is a Z 2 Z 2 u -linear code group isomorphic to Z 2 k 0 + k 2 × Z 2 2 k 1 , then we say C is of type α β k 0 k 1 k 2 . We can consider any Z 2 Z 2 u -linear code C as a binary code under the special Gray map.

Definition 2.3. Let a 0 a 1 a α 1 b 0 b 1 b β 1 Z 2 α × R β with b i = p i + uq i . We define the Gray map as follows:

Ψ : Z 2 α × R β Z 2 n Ψ a 0 a 1 a α 1 p 0 + uq 0 p 1 + uq 1 p β 1 + uq β 1 = a 0 a 1 a α 1 q 0 q 1 q β 1 p 0 + q 0 p 1 + q 1 p β 1 + q β 1

where n = α + 2 β . The Gray map Ψ is an isometry which transforms the Lee distance in Z 2 α × R β to the Hamming distance in Z 2 n . The Hamming and the Lee distance between two codewords is the Hamming weight and the Lee weight of their differences, respectively. The Hamming weight of a codeword is defined as the number of its non-zero entries, and the Lee weights of the elements of R are defined as wt L 0 = 0 , wt L 1 = 1 , wt L u = 2 , wt L 1 + u = 1 . It is worth mentioning that the Gray map Ψ is linear, i.e., for a Z 2 Z 2 u -linear code C , we have Ψ C as a binary linear code which is not the case for Z 2 Z 4 -additive codes in general. We can extend the definition of the Lee weight of a codeword in R to the Lee weight of a codeword v = v 1 v 2 Z 2 α × R β as follows:

wt v = wt H v 1 + wt L v 2

where wt H v 1 is the Hamming weight of v 1 and wt L v 2 is the Lee weight of v 2 . Further, the minimum distance of the Z 2 Z 2 u -linear code C , denoted by d C , is naturally defined as

d C = min d c 1 c 2 c 1 c 2 C such that c 1 c 2

where d c 1 c 2 = wt c 1 c 2 . If C is a Z 2 Z 2 u -linear code of type α β k 0 k 1 k 2 , then Gray image Ψ C is a binary linear code of length n = α + 2 β and size 2 n . It is also called a Z 2 Z 2 u -linear code.

2.1 Generator matrices of Z 2 Z 2 [u]-linear codes

A generator matrix for a linear code C is the matrix G with rows that are formed by a minimal spanning set of C . All linear combinations of the rows of the generator matrix G constitute the linear code C . We can produce an equivalent code to the C by applying elementary row and column operations on the generator matrix G. For given two linear codes, if one can be obtained from the other by permutation of their coordinates or (if necessary) changing the coordinates by their unit multiples, then these codes are said to be permutation equivalent code or only equivalent code. Furthermore, the standard form of the matrix G is a special form which is obtained by applying elementary row operations to G. Having the standard form of the generator matrix is very useful that we can easily determine the type of the code and then calculate its size directly. Note that the generator matrices in the standard form of linear codes over a ring contain the minimum number of rows. The theorem below determines the standard form of the generator matrix of a Z 2 Z 2 u -linear code C .

Theorem 2.1.1. [3] Let C be a Z 2 Z 2 u -linear code of type α β k 0 k 1 k 2 . Then C is a permutation equivalent to a Z 2 Z 2 u -linear code with the following generator matrix of the standard form:

G s = I k 0 A 1 0 0 uT 0 S I k 1 A B 1 + uB 2 0 0 0 uI k 2 uD E1

where A , A 1 , B 1 , B 2 , T , and D are matrices with all entries from Z 2 and I k 0 , I k 1 , and I k 2 are identity matrices with given sizes. Further C has 2 k 0 + 2 k 1 + k 2 codewords.

Proof. It is well known that any linear code of length β over the ring R = Z 2 + u Z 2 has the generator matrix of the form I k 1 A ' B 1 ' + uB 2 ' 0 uI k 2 ' uD ' . Moreover, any binary linear code of length α can be generated by the matrix I k 0 ' A 1 ' . Since C is a Z 2 Z 2 u -linear code of length α + β , then C can be generated by the following matrix:

I k 0 ' A 1 ' S 01 S 11 S 02 S 12 α T 01 T 02 T 03 I k 1 A ' B 1 ' + uB 2 ' 0 uI k 2 ' uD ' β

with all binary entries. By applying the necessary row operations to the above matrix, we have the desired form.

Example 2.1.2. Let C be a Z 2 Z 2 u -linear code with the generator matrix 1 0 1 1 0 1 1 + u 1 1 + u 1 + u . First, adding the second row to the first row, we have

1 0 0 1 1 1 u 1 0 1 + u .

Then multiplying the second row by u and adding it to first row, we have the following standard form of the generator matrix:

1 0 0 1 1 1 0 1 u 1 + u = I k 0 0 A 1 S 0 I k 1 uT B 1 + uB 2 E2

Therefore,

  • C is of type 3 2 1 1 0 .

  • C has 2 1 + 2 1 = 8 codewords:

C = 0 0 0 0 0 1 0 1 0 u 0 1 1 1 1 + u 1 1 0 1 1 , 0 1 1 1 + u 1 , 1 1 0 1 + u 1 + u 0 0 0 u u 1 0 1 u 0 .

Moreover, the Gray image Ψ C of C is a simplex code of length 7 with parameters [7, 3, 4] which is the dual of the well-known [7, 4, 3] Hamming code.

2.2 Duality on Z 2 Z 2 [u]-linear codes and parity-check matrices

In the literature, there is a very well-known concept for the duals of the codes over finite fields and rings. If C is a linear code over F q n , the dual code C of C in F q n is the set of all codewords that are orthogonal to every codeword of C . A generator matrix for C is called a parity-check matrix of C . In this part, we determine the standard form of the parity-check matrix of a Z 2 Z 2 u -linear code C . Let us begin with the definition of an inner product over Z 2 α × R β .

Definition 2.2.1 Let v and w be the two elements in Z 2 α × R β . The inner product of v and w is defined by

v w = u i = 1 α v ı w i + j = α + 1 α + β v j w j R .

Further, the dual code C of a Z 2 Z 2 u -linear code C is defined in the usual way with respect to this inner product as

C = w Z 2 α × R β v w = 0 for all v C .

Hence, if C is a Z 2 Z 2 u -linear code, then C is also a Z 2 Z 2 u -linear code. It is worth mentioning that any two codewords of a Z 2 Z 2 u -linear code may be orthogonal to each other, but the binary parts of the codewords may not be orthogonal. For example, 1 1 1 + u u , 0 1 u u Z 2 2 × R 2 are orthogonal to each other, whereas the binary or R -components are not orthogonal. Moreover, the Gray map Ψ preserves the orthogonality.

We give the standard form of the parity-check matrices of Z 2 Z 2 u -linear codes with the following theorem.

Theorem 2.2.2. [3] Let C be a Z 2 Z 2 u -linear code of type α β k 0 k 1 k 2 with the standard form generator matrix (1). Then the parity-check matrix of C (the generator matrix of the dual code C ) is given by

H s = A 1 t I α k 0 uS t 0 0 T t 0 B 1 + uB 2 t + D t A t D t I β k 1 k 2 0 0 uA t uI k 2 0 .

Furthermore, C = 2 α k 0 2 2 β k 1 k 2 2 k 2 .

Proof. It can be easily checked that G s H s t = 0 . Therefore every row of Hs is orthogonal to the rows of Gs . Further, since the generator matrices in the standard form of linear codes contain the minimum number of rows, C has 2 α k 0 2 2 β k 1 k 2 2 k 2 codewords. Hence, C C = 2 k 0 2 2 k 1 2 k 2 2 α k 0 2 2 β k 1 k 2 2 k 2 = 2 α + 2 β . So, the rows of the matrix H s are not only orthogonal to C , but also they generate all dual space.

Example 2.2.3. Let C be a Z 2 Z 2 u -linear code of type 3 2 1 1 0 with the standard form of the generator matrix in (2). Then the parity-check matrix of C is

A 1 t T t I 3 1 0 uS t B 1 + uB 2 t + D t A t 0 I 2 1 0 = 0 1 1 1 0 0 1 0 0 u u 1 + u 0 0 1 .

Therefore, C is of type 3 2 2 1 0 and has 2 2 2 2 1 2 0 = 16 codewords. The Gray image Ψ C is a well-known Hamming code with parameters 7 4 3 .

Corollary 2.2.4. If C is a Z 2 Z 2 u -linear code of type α β k 0 k 1 k 2 , then C is of type α β α k 0 β k 1 k 2 k 2 .

Advertisement

3. Z 2 Z 2[u]-linear cyclic codes

Cyclic codes form a very small but highly structured and important subset of the set of linear codes. In general, these codes are much easier to implement, and hence they have a very rich algebraic structure that allows them to be encoded and decoded in a relatively easier way. Since cyclic codes can be identified as ideals in a certain ring, they are also of considerable interest from an algebraic point of view. Cyclic codes over finite fields were first introduced by E. Prange in 1957 and 1959 with two Air Force Cambridge Research Laboratory reports. In this section we study the structure of Z 2 Z 2[u]-linear cyclic codes for a positive odd integer β . We give the generator polynomials and the spanning sets for a Z 2 Z 2[u]-linear cyclic code C .

Definition 3.1. An R -submodule C of Z 2 α × R β is called a Z 2 Z 2[u]-linear cyclic code if for any codeword v = a 0 a 1 a α 1 b 0 b 1 b β 1 C , its cyclic shift T v = a α 1 a 0 a α 2 b β 1 b 0 b β 2 is also in C .

Lemma 3.2. If C is a Z 2 Z 2[u]-linear cyclic code, then the dual code C is also a Z 2 Z 2[u]-linear cyclic code.

Proof. Let C be a Z 2 Z 2[u]-linear cyclic code and w = d 0 d 1 d α 1 e 0 e 1 e β 1 C . We will show that T w C . Since w C , for v = a 0 a 1 a α 1 b 0 b 1 b β 1 C , we have

v w = u a 0 d 0 + a 1 d 1 + + a α 1 d α 1 + b 0 e 0 + b 1 e 1 + + b β 1 e β 1 = 0 .

Now, let θ = lcm α β . Since C is cyclic, then T θ v = v , and T θ 1 v = a 1 a 2 a 0 b 1 b 2 b 0 = z C . Therefore,

0 = z w = u a 1 d 0 + a 2 d 1 + + a 0 d α 1 + b 1 e 0 + b 2 e 1 + + b 0 e β 1 = u a 0 d α 1 + a 1 d 0 + + a α 1 d α 2 + b 0 e β 1 + b 1 e 0 + + b β 1 e β 2 = v T w .

Hence, T w C and so C is also cyclic.

Let C Z 2 α × R β and v = a 0 a 1 a α 1 b 0 b 1 b β 1 C . v C can be identified with a module element consisting of two polynomials each from different rings in R α , β = Z 2 x / x α 1 × R x / x β 1 such that

v x = a 0 + a 1 x + + a α 1 x α 1 b 0 + b 1 x + + b β 1 x β 1 = a x b x .

This identification gives a one-to-one correspondence between elements in Z 2 α × R β and elements in R α , β .

Definition 3.3. Let d x R x and v x w x R a , β . We define the following scalar multiplication:

d x v x w x = d x v x mod u d x w x

This multiplication is well defined, and moreover, R α , β is a R x -module with respect to this multiplication.

The codewords of C may be represented as polynomials in R α , β by using the above identification. Thus, if C Z 2 α × R β is a cyclic code, then the element v = a 0 a 1 a α 1 b 0 b 1 b β 1 C can be viewed as

v x = a 0 + a 1 x + + a α 1 x α 1 b 0 + b 1 x + + b β 1 x β 1 R α , β .

Further, the property T v = a α 1 a 0 a α 2 b β 1 b 0 b β 2 C translates to

x v x = a α 1 + a 0 x + + a α 2 x α 1 b β 1 + b 0 x + + b β 2 x β 1 R α , β .

Hence we give the following theorem.

Theorem 3.4. A code C is a Z 2 Z 2 u -linear cyclic code if and only if C is an R x -submodule of R α , β .

3.1 The generators and the spanning sets of Z 2 Z 2 [u]-linear cyclic codes

Let C be a Z 2 Z 2 u -linear code. We know that both C and R [x]/⟨xβ  − 1⟩ are R x -modules. Then we define the following map:

Φ : C R x / x β 1 Φ f 1 x f 2 x = f 2 x .

It is clear that Φ is a module homomorphism where the Im Φ is an R [x]-submodule of R [x]/⟨xβ  − 1⟩ and ker Φ is a submodule of C . Since Φ C is an ideal of the ring R [x]/⟨xβ  − 1⟩, we have

Φ C = g x + ua x with a x g x x β 1 mod   2 .

Further the kernel of Φ is

ker Φ = f x 0 C f x Z 2 α × R β .

Now, define the set

I = f x Z 2 x / x α 1 f x 0 ker Φ .

It is clear that I is an ideal and hence a cyclic code in the ring Z 2 x / x α 1 . So, by the well-known results about the generators of binary cyclic codes, I is generated by f(x), i.e., I = f x .

Now, let m x 0 ker Φ . So, we have m x I = f x , and hence m x = k x f x for some polynomial k x Z 2 x / x α 1 . Therefore m x 0 = k x f x 0 , and this implies that ker Φ is a submodule of C generated by one element of the form f x 0 with f x x α 1 mod   2 . Then by the First Isomorphism Theorem, we have

C / ker Φ g x + ua x .

Let l x g x + ua x C such that Φ l x g x + ua x = g x + ua x . This discussion shows that any Z 2 Z 2 u -linear cyclic code C can be generated as a R [x]-submodule of R α,β by two elements of the form (f(x),0) and l x g x + ua x such that

d 1 x f x 0 + d 2 x l x g x + ua x

where d 1 x , d 2 x R x . Since the polynomial d 1 x can be restricted to a polynomial in Z 2 x , we can write

C = f x 0 l x g x + ua x

with binary polynomials f x and l x where f x x α 1 mod   2 and a x g x x β 1 mod   2 .

Theorem 3.1.1. [4] Let C be a Z 2 Z 2 u -linear cyclic code in R α , β . Then C can be identified uniquely as C = f x 0 l x g x + ua x where f x x α 1 mod   2 , a x g x x β 1 mod   2 , and l x is a binary polynomial satisfying deg l x < deg f x and f x x β 1 a x l x mod u .

Proof. We can easily see from the above discussion and Theorem 11 in [5] that C = f x 0 l x g x + ua x with the polynomials f x , l x , g x and a x are as stated in the theorem. So, we need to only show the uniqueness of the generator polynomials. Since f x and g x + ua x are cyclic codes over Z 2 and over R , respectively, this implies the uniqueness of the polynomials f x , g x and a x . Now suppose that deg l x > deg f x with deg l x deg f x = t . Let

D = f x 0 l x + x t f x g x + ua x = f x 0 l x g x + ua x + x t f x 0 .

Therefore D C . On the other hand,

l x g x + ua x = l x + x t f x g x + ua x x t f x 0 .

So, C D and hence D = C .

Definition 3.1.2. Let N be an R -module. A linearly independent subset P of N that spans N is called a basis of N . If an R -module has a basis, then it is called a free R -module.

Note that for a Z 2 Z 2 u -linear cyclic code C = f x 0 l x g x + ua x , if g x 0 , then C is a free R -module. However, if g x = 0 and a x 0 , then it is not a free R -module. But we can still present C with the minimal spanning sets. The following theorem determines the minimal spanning sets for a Z 2 Z 2 u -linear cyclic code C .

Theorem 3.1.3. [4] Let C = f x 0 l x g x + ua x be a Z 2 Z 2 u -linear cyclic code in R α , β with f x , l x , g x , and a x in Theorem 3.1.1. Let

S 1 = i = 0 deg h f x 1 x i f x 0 , S 2 = i = 0 deg h g x 1 x i l x g x + ua x , S 3 = i = 0 deg b x 1 x i h g x l x uh g x a x

where f x h f x = x α 1 , g x h g x = x β 1 and g x = a x b x . Then S = S 1 S 2 S 3 forms a minimal spanning set for C as an R -module. Furthermore, C has 2 deg h f x 4 deg h g x 2 deg b x codewords.

Proof. Please see the proof of the Theorem 4 in [4].

Example 3.1.4. Let C = f x 0 l x g x + ua x be a Z 2 Z 2 u -linear cyclic code in Z 2 x / x 7 1 × R x / x 7 1 with the following generator polynomials:

f x = x 7 1 , l x = 1 + x 2 + x 3 g x = 1 + x + x 2 + x 3 + x 4 + x 5 + x 6 , a x = 1 + x 2 + x 3 .

Therefore, we have g x = a x b x b x = 1 + x + x 3 and g x h g x = x 7 1 h g x = 1 + x . Hence by using the minimal spanning sets in Theorem 3.1.3, we can write the generator matrix for the Z 2 Z 2 u -linear cyclic code C as follows:

G = 1 0 1 1 0 0 0 1 + u 1 1 + u 1 + u 1 1 1 1 1 1 0 1 0 0 u u u 0 u 0 0 0 1 1 1 0 1 0 0 u u u 0 u 0 0 0 1 1 1 0 1 0 0 u u u 0 u .

It is worth mentioning that the Gray image Φ C of C is a linear binary code with the parameters [21, 5, 10], which are optimal. If the code C has the best minimum distance compared to the existing bounds for fixed length and the size, then C is called optimal or good parameter code.

Example 3.1.5. Let us consider the cyclic code C = f x 0 l x g x + ua x in Z 2 x / x 7 1 × R x / x 9 1 with generators:

f x = 1 + x 2 + x 3 + x 4 , l x = 1 + x + x 3 , g x = 1 + x + x 2 + x 3 + x 4 + x 5 + x 6 + x 7 + x 8 , a x = 1 + x + x 2 .

Again by using the minimal spanning sets in the above theorem, we have the following generator matrix for C :

G = 1 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 1 1 0 0 0 0 0 0 0 0 0 1 1 0 1 0 0 0 1 + u 1 + u 1 + u 1 1 1 1 1 1 1 0 1 1 1 0 0 u 0 0 u 0 0 0 0 0 0 1 0 1 1 1 0 0 u 0 0 u 0 0 0 0 0 0 1 0 1 1 1 0 0 u 0 0 u 0 0 0 1 0 0 1 0 1 1 0 0 0 u 0 0 u 0 0 1 1 0 0 1 0 1 0 0 0 0 u 0 0 u 0 1 1 1 0 0 1 0 0 0 0 0 0 u 0 0 u .

The Gray image Φ C of C is a [25, 11, 4] linear binary code. Moreover we can write the standard form of this generator matrix as

Hence C is of type 7 9 3 1 6 and has 2 11 = 2048 codewords.

Advertisement

4. Conclusion

In this chapter we introduced Z 2 Z 2[u]-linear and Z 2 Z 2[u]-cyclic codes. We determined the standard forms of the generator and parity-check matrices of Z 2 Z 2[u]-linear codes. We further gave the generator polynomials and minimal spanning sets for Z 2 Z 2[u]-linear cyclic codes. We also presented some illustrative examples of both Z 2 Z 2[u]-linear codes and Z 2 Z 2[u]-cyclic codes.

Advertisement

Acknowledgments

The author would like to thank professors Irfan Siap and Taher Abualrub for their valuable comments and suggestions to improve the quality of the chapter.

References

  1. 1. Hammons AR, Kumar V, Calderbank AR, Sloane NJA, Solé P. The Z4-linearity of Kerdock, Preparata, Goethals, and related codes. IEEE Transactions on Information Theory. 1994;40:301-319
  2. 2. Borges J, Fernández-Córdoba C, Pujol J, Rifà J, Villanueva M. Z2Z4-linear codes: Generator matrices and duality. Designs, Codes and Cryptography. 2010;54(2):167-179
  3. 3. Aydogdu I, Abualrub T, Siap I. On Z2Z2[u]−additive codes. International Journal of Computer Mathematics. 2015;92(9):1806-1814
  4. 4. Aydogdu I, Abualrub T, Siap I. Z2Z2[u]-cyclic and constacyclic codes. IEEE Transactions on Information Theory. 2017;63(8):4883-4893
  5. 5. Abualrub T, Siap I, Aydin N. Z2Z4-additive cyclic codes. IEEE Transactions on Information Theory. 2014;60(3):1508-1514

Written By

Ismail Aydogdu

Submitted: 18 January 2019 Reviewed: 10 April 2019 Published: 23 October 2019