اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدProjective Parameterized Linear Codes Arising from some Matrices and their Main Parameters
140
0
0.0
(
0
)
نشر من قبل
Manuel Gonz\\'alez Sarabia
تاريخ النشر
2011
مجال البحث
الهندسة المعلوماتية
والبحث باللغة
English
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper we will estimate the main parameters of some evaluation codes which are known as projective parameterized codes. We will find the length of these codes and we will give a formula for the dimension in terms of the Hilbert function associated to two ideals, one of them being the vanishing ideal of the projective torus. Also we will find an upper bound for the minimum distance and, in some cases, we will give some lower bounds for the regularity index and the minimum distance. These lower bounds work in several cases, particularly for any projective parameterized code associated to the incidence matrix of uniform clutters and then they work in the case of graphs.
قيم البحث
اقرأ أيضاً
In this paper we find the second generalized Hamming weight of some evaluation codes arising from a projective torus, and it allows to compute the second generalized Hamming weight of the codes parameterized by the edges of any complete bipartite gra
ph. Also, at the beginning, we obtain some results about the generalized Hamming weights of some evaluation codes arising from a complete intersection when the minimum distance is known and they are non--degenerate codes. Finally we give an example where we use these results to determine the complete weight hierarchy of some codes.
We obtain a characterization on self-orthogonality for a given binary linear code in terms of the number of column vectors in its generator matrix, which extends the result of Bouyukliev et al. (2006). As an application, we give an algorithmic method
to embed a given binary $k$-dimensional linear code $mathcal{C}$ ($k = 2,3,4$) into a self-orthogonal code of the shortest length which has the same dimension $k$ and minimum distance $d ge d(mathcal{C})$. For $k > 4$, we suggest a recursive method to embed a $k$-dimensional linear code to a self-orthogonal code. We also give new explicit formulas for the minimum distances of optimal self-orthogonal codes for any length $n$ with dimension 4 and any length $n otequiv 6,13,14,21,22,28,29 pmod{31}$ with dimension 5. We determine the exact optimal minimum distances of $[n,4]$ self-orthogonal codes which were left open by Li-Xu-Zhao (2008) when $n equiv 0,3,4,5,10,11,12 pmod{15}$. Then, using MAGMA, we observe that our embedding sends an optimal linear code to an optimal self-orthogonal code.
In this paper, a linear $ell$-intersection pair of codes is introduced as a generalization of linear complementary pairs of codes. Two linear codes are said to be a linear $ell$-intersection pair if their intersection has dimension $ell$. Charact
erizations and constructions of such pairs of codes are given in terms of the corresponding generator and parity-check matrices. Linear $ell$-intersection pairs of MDS codes over $mathbb{F}_q$ of length up to $q+1$ are given for all possible parameters. As an application, linear $ell$-intersection pairs of codes are used to construct entanglement-assisted quantum error correcting codes. This provides a large number of new MDS entanglement-assisted quantum error correcting codes.
Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain self-orthogona
lity over finite fields is an effective way to obtain good $q$-ary quantum codes of large length. Specifically, it follows from CSS construction (resp. Hermitian construction) that a matrix-product code over $mathbb{F}_{q}$ (resp. $mathbb{F}_{q^{2}}$) which is Euclidean dual-containing (resp. Hermitian dual-containing) can produce a $q$-ary quantum code. In order to obtain such matrix-product codes, a common way is to construct quasi-orthogonal matrices (resp. quasi-unitary matrices) as the defining matrices of matrix-product codes over $mathbb{F}_{q}$ (resp. $mathbb{F}_{q^{2}}$). The usage of NSC quasi-orthogonal matrices or NSC quasi-unitary matrices in this process enables the minimum distance lower bound of the corresponding quantum codes to reach its optimum. This article has two purposes: the first is to summarize some results of this topic obtained by the author of this article and his cooperators in cite{Cao2020Constructioncaowang,Cao2020New,Cao2020Constructionof}; the second is to add some new results on quasi-orthogonal matrices (resp. quasi-unitary matrices), Euclidean dual-containing (resp. Hermitian dual-containing) matrix-product codes and $q$-ary quantum codes derived from these newly constructed matrix-product codes.
Practically good error-correcting codes should have good parameters and efficient decoding algorithms. Some algebraically defined good codes such as cyclic codes, Reed-Solomon codes, and Reed-Muller codes have nice decoding algorithms. However, many
optimal linear codes do not have an efficient decoding algorithm except for the general syndrome decoding which requires a lot of memory. Therefore, it is a natural question whether which optimal linear codes have an efficient decoding. We show that two binary optimal $[36,19,8]$ linear codes and two binary optimal $[40,22,8]$ codes have an efficient decoding algorithm. There was no known efficient decoding algorithm for the binary optimal $[36,19,8]$ and $[40,22,8]$ codes. We project them onto the much shorter length linear $[9,5,4]$ and $[10, 6, 4]$ codes over $GF(4)$, respectively. This decoding algorithms, called {em projection decoding}, can correct errors of weight up to 3. These $[36,19,8]$ and $[40,22,8]$ codes respectively have more codewords than any optimal self-dual $[36, 18, 8]$ and $[40,20,8]$ codes for given length and minimum weight, implying that these codes more practical.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
