Browsing by Author "mashker"
Now showing items 1-20 of 20
-
Cyclic codes over {Z_2+ uZ_2+ u^ 2Z_2+\ldots+ u^{k-1} Z_2}
(The Scientific and Technological Research Council of Turkey, 2011)In this paper, we study the structure of cyclic codes of an arbitrary length n over the ring Z_2+ uZ_2+ u^ 2Z_2+\ldots+ u^{k-1} Z_2, where u^ k= 0. Also we study the rank for these codes, and we find their minimal spanning ... -
Idempotent generators of cyclic and quadratic residue codes over
(الجامعة الإسلامية - غزة, 2013)In this paper we study idempotent generators of cyclic codes and quadratic residue codes over R = , where and . The forms of some idempotents over this ring are given, the quadratic residue codes are defined in forms of ... -
-
Linear codes over F2+ uF2
(2003) -
-
LINEAR CODES OVER Z4 USING ALMOST-GREEDY ALGORITHM
(الجامعة الإسلامية - غزة, 2003)In this paper we prove thate the almost-greedy and almost self- orthogonal greedy codes over Z4 with Lee distance are linear when they are generated by using the B-ordering and the almost-greedy algorithm of any ordered ... -
LINEAR CODES OVER Z4 USING ALMOST-GREEDY ALGORITHM
(الجامعة الإسلامية - غزة, 2003)In this paper we prove thate the almost-greedy and almost self- orthogonal greedy codes over Z4 with Lee distance are linear when they are generated by using the B-ordering and the almost-greedy algorithm of any ordered ... -
-
MacDonald codes over the ring F2+ uF2+ u2F2
(2010)Recently codes over finite rings have received much attention. In [1] MacDonald codes of type α and β over the ring F2+ uF2 were given as a generalization of MacDonald codes over Z4 [5]. In this paper, we construct MacDonald ... -
MacDonald codes over the ring F3+ vF3
(2012)The binary MacDonald codes were introduced in [9] and q− ary version (q≥ 2) MacDonald code over the finite field Fq was studied in [10]. In [5], CJ Colbourn and M. Gupta obtained two families of MacDonald codes over the ... -
On Almost 2-Absorbing Primary Sub-modules
(الجامعة الإسلامية - غزة, 2017)Let R be a commutative ring with identity and M be a unitary R-module, In this paper we introduce the concept of almost 2-absorbing primary sub-modules as a new generalization of 2-absorbing sub-modules. We study some basic ... -
Simplex Codes of Type γ over F3+ vF3
(2010)In this paper, it is constructed simplex linear codes over the ring F3+ vF3 of type γ, where v 2= 1 and F3={0, 1, 2} and obtained the minimum Hamming, Lee and Bachoc weights of this codes. -
Simplex Codes over the Ring F~ 2+ uF~ 2
(Dhahran, Saudi Arabia: King Fahd University of Petroleum and Minerals, c1997-, 2005)In this paper, we obtain simplex codes over the ring F2+ uF2. These codes are the generalization of simplex codes over the ring¢ 4. -
Simplex Codes Over the Ring\sum_ {n= 0}^ su^ n F_2
(The Scientific and Technological Research Council of Turkey, 2005)In this paper, we introduce simplex linear codes over the ring\sum_ {n= 0}^{n= s} u^ n F_2 of types\alpha and\beta, where u^{s+ 1}= 0. And we determine their properties. These codes are an extension and generalization of ... -
Simplex Linear Codes Over the Ring F2+ vF2
(جامعة النجاح الوطنية, 2008) -
Skew constacyclic codes over Fp+ vFp
(2016)In this paper, we study a special class of linear codes called skew constacyclic codes over finite non-chain rings of the form Fp+ vFp, where p is an odd prime and v2= v. We use ideal θv-constacyclic codes to define skew ... -
تراميز ماكدونالد على الحلقة
(الجامعة الإسلامية - غزة, 2010)In this paper, we construct MacDonald codes of type and over the ring F 2 +uF 2 +u 2 F 2 where u 3 = 0 and study Gray image properties, torsion code, weight distribution. Finally we obtain linear binary codes by gray map. -
تراميز ماكدونالد على الحلقة
(الجامعة الإسلامية - غزة, 2012)In this paper, we construct MacDonald codes of type over the ring F 3 + vF 3 , where v 2 = 1, F 3 = {0, 1, 2} is the field of three elements and investigate some of their properties such as torsion codes and weight ... -
طريقة جبرية جديدة لفك تراميز البواقي التربيعية (41, 21, 9)
(2015)في هذا البحث قمنا بإيجاد طريقة جبرية جديدة لفك تراميز الكود الثنائى (41, 21, 9), ووجدنا خصائص عامة لـ syndromes و الفئات الفرعية لكود البواقي التربيعية الثنائي ذات الطول الفردي علي الصيغة ن= 8ك±1 حيث ك عدد صحيح, باستخدام ... -
طريقة جبرية جديدة لفك تراميز البواقي التربيعية (41,21,9)
(الجامعة الإسلامية - غزة, 2011)In this paper, a decoding algorithm was given for the (41, 21, 9) binary QR code. Here, some new more general properties are found for the syndromes of the subclass of binary QR codes of length n = 8l + 1. Using these ...