اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSimplex and MacDonald Codes over $R_{q}$
141
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we introduce the homogeneous weight and homogeneous Gray map over the ring $R_{q}=mathbb{F}_{2}[u_{1},u_{2},ldots,u_{q}]/leftlangle u_{i}^{2}=0,u_{i}u_{j}=u_{j}u_{i}rightrangle$ for $q geq 2$. We also consider the construction of simplex and MacDonald codes of types $alpha$ and $beta$ over this ring.
قيم البحث
اقرأ أيضاً
Let $mathbb{F}_q$ be a finite field of order $q$, a prime power integer such that $q=et+1$ where $tgeq 1,egeq 2$ are integers. In this paper, we study cyclic codes of length $n$ over a non-chain ring $R_{e,q}=mathbb{F}_q[u]/langle u^e-1rangle$. We de
fine a Gray map $varphi$ and obtain many { maximum-distance-separable} (MDS) and optimal $mathbb{F}_q$-linear codes from the Gray images of cyclic codes. Under certain conditions we determine { linear complementary dual} (LCD) codes of length $n$ when $gcd(n,q) eq 1$ and $gcd(n,q)= 1$, respectively. It is proved that { a} cyclic code $mathcal{C}$ of length $n$ is an LCD code if and only if its Gray image $varphi(mathcal{C})$ is an LCD code of length $4n$ over $mathbb{F}_q$. Among others, we present the conditions for existence of free and non-free LCD codes. Moreover, we obtain many optimal LCD codes as the Gray images of non-free LCD codes over $R_{e,q}$.
BCH codes are an interesting class of cyclic codes due to their efficient encoding and decoding algorithms. In many cases, BCH codes are the best linear codes. However, the dimension and minimum distance of BCH codes have been seldom solved. Until no
w, there have been few results on BCH codes over $gf(q)$ with length $q^m+1$, especially when $q$ is a prime power and $m$ is even. The objective of this paper is to study BCH codes of this type over finite fields and analyse their parameters. The BCH codes presented in this paper have good parameters in general, and contain many optimal linear codes.
In this paper we investigate linear codes with complementary dual (LCD) codes and formally self-dual codes over the ring $R=F_{q}+vF_{q}+v^{2}F_{q}$, where $v^{3}=v$, for $q$ odd. We give conditions on the existence of LCD codes and present construct
ion of formally self-dual codes over $R$. Further, we give bounds on the minimum distance of LCD codes over $F_q$ and extend these to codes over $R$.
In this paper, we give conditions for the existence of Hermitian self-dual $Theta-$cyclic and $Theta-$negacyclic codes over the finite chain ring $mathbb{F}_q+umathbb{F}_q$. By defining a Gray map from $R=mathbb{F}_q+umathbb{F}_q$ to $mathbb{F}_{q}^{
2}$, we prove that the Gray images of skew cyclic codes of odd length $n$ over $R$ with even characteristic are equivalent to skew quasi-twisted codes of length $2n$ over $mathbb{F}_q$ of index $2$. We also extend an algorithm of Boucher and Ulmer cite{BF3} to construct self-dual skew cyclic codes based on the least common left multiples of non-commutative polynomials over $mathbb{F}_q+umathbb{F}_q$.
We introduce a consistent and efficient method to construct self-dual codes over $GF(q)$ with symmetric generator matrices from a self-dual code over $GF(q)$ of smaller length where $q equiv 1 pmod 4$. Using this method, we improve the best-known min
imum weights of self-dual codes, which have not significantly improved for almost two decades. We focus on a class of self-dual codes, including double circulant codes. Using our method, called a `symmetric building-up construction, we obtain many new self-dual codes over $GF(13)$ and $GF(17)$ and improve the bounds of best-known minimum weights of self-dual codes of lengths up to 40. Besides, we compute the minimum weights of quadratic residue codes that were not known before. These are: a [20,10,10] QR self-dual code over $GF(23)$, two [24,12,12] QR self-dual codes over $GF(29)$ and $GF(41)$, and a [32,12,14] QR self-dual codes over $GF(19)$. They have the highest minimum weights so far.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
