Linear codes over Z4+uZ4: MacWilliams identities, projections, and formally self-dual codes

نویسندگان

  • Bahattin Yildiz
  • Suat Karadeniz
چکیده

Linear codes are considered over the ring Z 4 + uZ 4 , a non-chain extension of Z 4. Lee weights, Gray maps for these codes are defined and MacWilliams identities for the complete, symmetrized and Lee weight enumer-ators are proved. Two projections from Z 4 + uZ 4 to the rings Z 4 and F 2 + uF 2 are considered and self-dual codes over Z 4 +uZ 4 are studied in connection with these projections. Finally three constructions are given for formally self-dual codes over Z 4 + uZ 4 and their Z 4-images together with some good examples of formally self-dual Z 4-codes obtained through these constructions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some results of linear codes over the ring $\mathbb{Z}_4+u\mathbb{Z}_4+v\mathbb{Z}_4+uv\mathbb{Z}_4$

Abstract: In this paper, we mainly study the theory of linear codes over the ring R = Z4 + uZ4 + vZ4 + uvZ4. By the Chinese Remainder Theorem, we have R is isomorphic to the direct sum of four rings Z4. We define a Gray map Φ from R n to Z 4 , which is a distance preserving map. The Gray image of a cyclic code over R is a linear code over Z4. Furthermore, we study the MacWilliams identities of ...

متن کامل

Negacyclic codes over Z4+uZ4

In this paper, we study negacyclic codes of odd length and of length 2k over the ring R = Z4 + uZ4, u2 = 0. We give the complete structure of negacyclic codes for both the cases. We have obtained a minimal spanning set for negacyclic codes of odd lengths over R. A necessary and sufficient condition for negacyclic codes of odd lengths to be free is presented. We have determined the cardinality o...

متن کامل

Cyclic codes over $\mathbb{Z}_4[u]/\langle u^k\rangle$ of odd length

Let R = Z4[u]/〈u〉 = Z4 + uZ4 + . . . + uZ4 (u = 0) where k ∈ Z satisfies k ≥ 2. For any odd positive integer n, it is known that cyclic codes over R of length n are identified with ideals of the ring R[x]/〈x − 1〉. In this paper, an explicit representation for each cyclic code over R of length n is provided and a formula to count the number of codewords in each code is given. Then a formula to c...

متن کامل

Isometries and Binary Images of Linear Block Codes over Z4+uZ4 and Z8+uZ8

Let F2 be the binary field and Z2r the residue class ring of integers modulo 2 , where r is a positive integer. For the finite 16-element commutative local Frobenius nonchain ring Z4 + uZ4, where u is nilpotent of index 2, two weight functions are considered, namely the Lee weight and the homogeneous weight. With the appropriate application of these weights, isometric maps from Z4 + uZ4 to the ...

متن کامل

Cyclic Codes and Self-Dual Codes Over

We introduce linear cyclic codes over the ring F 2 + uF 2 = f0; 1; u; u = u + 1g, where u = 0 and study them by analogy with the Z4 case. We give the structure of these codes on this new alphabet. Self-dual codes of odd length exist as in the case of Z4-codes. Unlike the Z4 case, here free codes are not interesting. Some nonfree codes give rise to optimal binary linear codes and extremal self-d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Finite Fields and Their Applications

دوره 27  شماره 

صفحات  -

تاریخ انتشار 2014