اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOne dimensional Convolutional Goppa Codes over the projective line
95
0
0.0
(
0
)
نشر من قبل
Gloria Serrano Sotelo
تاريخ النشر
2011
مجال البحث
الهندسة المعلوماتية
والبحث باللغة
English
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We give a general method to construct MDS one-dimensional convolutional codes. Our method generalizes previous constructions of H. Gluesing-Luerssen and B. Langfeld. Moreover we give a classification of one-dimensional Convolutional Goppa Codes and propose a characterization of MDS codes of this type.
قيم البحث
اقرأ أيضاً
A fault injection framework for the decryption algorithm of the Niederreiter public-key cryptosystem using binary irreducible Goppa codes and classical decoding techniques is described. In particular, we obtain low-degree polynomial equations in part
s of the secret key. For the resulting system of polynomial equations, we present an efficient solving strategy and show how to extend certain solutions to alternative secret keys. We also provide estimates for the expected number of required fault injections, apply the framework to state-of-the-art security levels, and propose countermeasures against this type of fault attack.
Projective Reed-Muller codes were introduced by Lachaud, in 1988 and their dimension and minimum distance were determined by Serre and S{o}rensen in 1991. In coding theory one is also interested in the higher Hamming weights, to study the code perfor
mance. Yet, not many values of the higher Hamming weights are known for these codes, not even the second lowest weight (also known as next-to-minimal weight) is completely determined. In this paper we determine all the values of the next-to-minimal weight for the binary projective Reed-Muller codes, which we show to be equal to the next-to-minimal weight of Reed-Muller codes in most, but not all, cases.
In this paper we present several values for the next-to-minimal weights of projective Reed-Muller codes. We work over $mathbb{F}_q$ with $q geq 3$ since in IEEE-IT 62(11) p. 6300-6303 (2016) we have determined the complete values for the next-to-mini
mal weights of binary projective Reed-Muller codes. As in loc. cit. here we also find examples of codewords with next-to-minimal weight whose set of zeros is not in a hyperplane arrangement.
Goppa codes are particularly appealing for cryptographic applications. Every improvement of our knowledge of Goppa codes is of particular interest. In this paper, we present a sufficient and necessary condition for an irreducible monic polynomial $g(
x)$ of degree $r$ over $mathbb{F}_{q}$ satisfying $gamma g(x)=(x+d)^rg({A}(x))$, where $q=2^n$, $A=left(begin{array}{cc} a&b1&dend{array}right)in PGL_2(Bbb F_{q})$, $mathrm{ord}(A)$ is a prime, $g(a) e 0$, and $0 e gammain Bbb F_q$. And we give a complete characterization of irreducible polynomials $g(x)$ of degree $2s$ or $3s$ as above, where $s$ is a positive integer. Moreover, we construct some binary irreducible quasi-cyclic parity-check subcodes of Goppa codes and extended Goppa codes.
A structure theorem of the group codes which are relative projective for the subgroup $lbrace 1 rbrace$ of $G$ is given. With this, we show that all such relative projective group codes in a fixed group algebra $RG$ are in bijection to the chains of
projective group codes of length $ell$ in the group algebra $mathbb{F}G$, where $mathbb{F}$ is the residue field of $R$. We use a given chain to construct the dual code in $RG$ and also derive the minimum Hamming weight as well as a lower bound of the minimum euclidean weight.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
