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

Two-weight codes over the integers modulo a prime power

70   0   0.0 ( 0 )
 نشر من قبل Minjia Shi
 تاريخ النشر 2019
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




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

Let $p$ be a prime number. Irreducible cyclic codes of length $p^2-1$ and dimension $2$ over the integers modulo $p^h$ are shown to have exactly two nonzero Hamming weights. The construction uses the Galois ring of characteristic $p^h$ and order $p^{2h}.$ When the check polynomial is primitive, the code meets the Griesmer bound of (Shiromoto, Storme) (2012). By puncturing some projective codes are constructed. Those in length $p+1$ meet a Singleton-like bound of (Shiromoto , 2000). An infinite family of strongly regular graphs is constructed as coset graphs of the duals of these projective codes. A common cover of all these graphs, for fixed $p$, is provided by considering the Hensel lifting of these cyclic codes over the $p$-adic numbers.



قيم البحث

اقرأ أيضاً

We consider $q$-ary (linear and nonlinear) block codes with exactly two distances: $d$ and $d+delta$. Several combinatorial constructions of optimal such codes are given. In the linear (but not necessary projective) case, we prove that under certain conditions the existence of such linear $2$-weight code with $delta > 1$ implies the following equality of great common divisors: $(d,q) = (delta,q)$. Upper bounds for the maximum cardinality of such codes are derived by linear programming and from few-distance spherical codes. Tables of lower and upper bounds for small $q = 2,3,4$ and $q,n < 50$ are presented.
Linear codes with a few weights have important applications in authentication codes, secret sharing, consumer electronics, etc.. The determination of the parameters such as Hamming weight distributions and complete weight enumerators of linear codes are important research topics. In this paper, we consider some classes of linear codes with a few weights and determine the complete weight enumerators from which the corresponding Hamming weight distributions are derived with help of some sums involving Legendre symbol.
Quantum synchronizable codes are kinds of quantum error-correcting codes that can not only correct the effects of quantum noise on qubits but also the misalignment in block synchronization. This paper contributes to constructing two classes of quantu m synchronizable codes by the cyclotomic classes of order two over $mathbb{Z}_{2q}$, whose synchronization capabilities can reach the upper bound under certain conditions. Moreover, the quantum synchronizable codes possess good error-correcting capability towards bit errors and phase errors.
151 - Shuxing Li , Sihuang Hu , Tao Feng 2012
The determination of weight distribution of cyclic codes involves evaluation of Gauss sums and exponential sums. Despite of some cases where a neat expression is available, the computation is generally rather complicated. In this note, we determine t he weight distribution of a class of reducible cyclic codes whose dual codes may have arbitrarily many zeros. This goal is achieved by building an unexpected connection between the corresponding exponential sums and the spectrums of Hermitian forms graphs.
148 - Cicero Carvalho 2013
We study affine cartesian codes, which are a Reed-Muller type of evaluation codes, where polynomials are evaluated at the cartesian product of n subsets of a finite field F_q. These codes appeared recently in a work by H. Lopez, C. Renteria-Marquez a nd R. Villareal and, in a generalized form, in a work by O. Geil and C. Thomsen. Using methods from Grobner basis theory we determine the second Hamming weight (also called next-to-minimal weight) for particular cases of affine cartesian codes and also some higher Hamming weights of this type of code.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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