ترغب بنشر مسار تعليمي؟ اضغط هنا

A Comparison of Distance Bounds for Quasi-Twisted Codes

135   0   0.0 ( 0 )
 نشر من قبل Buket Ozkaya
 تاريخ النشر 2020
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

Spectral bounds on the minimum distance of quasi-twisted codes over finite fields are proposed, based on eigenvalues of polynomial matrices and the corresponding eigenspaces. They generalize the Semenov-Trifonov and Zeh-Ling bounds in a way similar to how the Roos and shift bounds extend the BCH and HT bounds for cyclic codes. The eigencodes of a quasi-twisted code in the spectral theory and the outer codes in its concatenated structure are related. A comparison based on this relation verifies that the Jensen bound always outperforms the spectral bound under special conditions, which yields a similar relation between the Lally and the spectral bounds. The performances of the Lally, Jensen and spectral bounds are presented in comparison with each other.



قيم البحث

اقرأ أيضاً

In this paper we develop a technique to extend any bound for the minimum distance of cyclic codes constructed from its defining sets (ds-bounds) to abelian (or multivariate) codes through the notion of $mathbb{B}$-apparent distance. We use this techn ique to improve the searching for new bounds for the minimum distance of abelian codes. We also study conditions for an abelian code to verify that its $mathbb{B}$-apparent distance reaches its (true) minimum distance. Then we construct some tables of such codes as an application
In this paper we develop a technique to extend any bound for cyclic codes constructed from its defining sets (ds-bounds) to abelian (or multivariate) codes. We use this technique to improve the searching of new bounds for abelian codes.
One of the main goals of coding theory is to construct codes with best possible parameters and properties. A special class of codes called quasi-twisted (QT) codes is well-known to produce codes with good parameters. Most of the work on QT codes has been over the 1-generator case. In this work, we focus on 2-generator QT codes and generalize the ASR algorithm that has been very effective to produce new linear codes from 1-generator QT codes. Moreover, we also generalize a recent algorithm to test equivalence of cyclic codes to constacyclic codes. This algorithm makes the ASR search even more effective. As a result of implementing our algorithm, we have found 103 QT codes that are new among the class of QT codes. Additionally, most of these codes possess the following additional properties: a) they have the same parameters as best known linear codes, and b) many of the have additional desired properties such as being LCD and dual-containing. Further, we have also found a binary 2-generator QT code that is new (record breaking) among all binary linear codes and its extension yields another record breaking binary linear code.
In this article, we present a new construction of evaluation codes in the Hamming metric, which we call twisted Reed-Solomon codes. Whereas Reed-Solomon (RS) codes are MDS codes, this need not be the case for twisted RS codes. Nonetheless, we show th at our construction yields several families of MDS codes. Further, for a large subclass of (MDS) twisted RS codes, we show that the new codes are not generalized RS codes. To achieve this, we use properties of Schur squares of codes as well as an explicit description of the dual of a large subclass of our codes. We conclude the paper with a description of a decoder, that performs very well in practice as shown by extensive simulation results.
107 - Hongwei Liu , Shengwei Liu 2020
Maximum distance separable (MDS) codes are optimal where the minimum distance cannot be improved for a given length and code size. Twisted Reed-Solomon codes over finite fields were introduced in 2017, which are generalization of Reed-Solomon codes. Twisted Reed-Solomon codes can be applied in cryptography which prefer the codes with large minimum distance. MDS codes can be constructed from twisted Reed-Solomon codes, and most of them are not equivalent to Reed-Solomon codes. In this paper, we first generalize twisted Reed-Solomon codes to generalized twisted Reed-Solomon codes, then we give some new explicit constructions of MDS (generalized) twisted Reed-Solomon codes. In some cases, our constructions can get MDS codes with the length longer than the constructions of previous works. Linear complementary dual (LCD) codes are linear codes that intersect with their duals trivially. LCD codes can be applied in cryptography. This application of LCD codes renewed the interest in the construction of LCD codes having a large minimum distance. We also provide new constructions of LCD MDS codes from generalized twisted Reed-Solomon codes.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا