اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدConstruction of Isodual Quasi-cyclic Codes over Finite Fields
155
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper considers the construction of isodual quasi-cyclic codes. First we prove that two quasi-cyclic codes are permutation equivalent if and only if their constituent codes are equivalent. This gives conditions on the existence of isodual quasi-cyclic codes. Then these conditions are used to obtain isodual quasi-cyclic codes. We also provide a construction for isodual quasi-cyclic codes as the matrix product of isodual codes.
قيم البحث
اقرأ أيضاً
Professor Cunsheng Ding gave cyclotomic constructions of cyclic codes with length being the product of two primes. In this paper, we study the cyclic codes of length $n=2^e$ and dimension $k=2^{e-1}$. Clearly, Dings construction is not hold in this p
lace. We describe two new types of generalized cyclotomy of order two, which are different from Dings. Furthermore, we study two classes of cyclic codes of length $n$ and dimension $k$. We get the enumeration of these cyclic codes. Whats more, all of the codes from our construction are among the best cyclic codes. Furthermore, we study the hull of cyclic codes of length $n$ over $mathbb{F}_q$. We obtain the range of $ell=dim({rm Hull}(C))$. We construct and enumerate cyclic codes of length $n$ having hull of given dimension.
In this paper, we construct four families of linear codes over finite fields from the complements of either the union of subfields or the union of cosets of a subfield, which can produce infinite families of optimal linear codes, including infinite f
amilies of (near) Griesmer codes. We also characterize the optimality of these four families of linear codes with an explicit computable criterion using the Griesmer bound and obtain many distance-optimal linear codes. In addition, we obtain several classes of distance-optimal linear codes with few weights and completely determine their weight distributions. It is shown that most of our linear codes are self-orthogonal or minimal which are useful in applications.
In this paper, we present three new classes of $q$-ary quantum MDS codes utilizing generalized Reed-Solomon codes satisfying Hermitian self-orthogonal property. Among our constructions, the minimum distance of some $q$-ary quantum MDS codes can be bi
gger than $frac{q}{2}+1$. Comparing to previous known constructions, the lengths of codes in our constructions are more flexible.
We apply quantum Construction X on quasi-cyclic codes with large Hermitian hulls over $mathbb{F}_4$ and $mathbb{F}_9$ to derive good qubit and qutrit stabilizer codes, respectively. In several occasions we obtain quantum codes with stricly improved p
arameters than the current record. In numerous other occasions we obtain quantum codes with best-known performance. For the qutrit ones we supply a systematic construction to fill some gaps in the literature.
In this paper, we show that LCD codes are not equivalent to linear codes over small finite fields. The enumeration of binary optimal LCD codes is obtained. We also get the exact value of LD$(n,2)$ over $mathbb{F}_3$ and $mathbb{F}_4$. We study the bound of LCD codes over $mathbb{F}_q$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
