اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOptimum Commutative Group Codes
150
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A method for finding an optimum $n$-dimensional commutative group code of a given order $M$ is presented. The approach explores the structure of lattices related to these codes and provides a significant reduction in the number of non-isometric cases to be analyzed. The classical factorization of matrices into Hermite and Smith normal forms and also basis reduction of lattices are used to characterize isometric commutative group codes. Several examples of optimum commutative group codes are also presented.
قيم البحث
اقرأ أيضاً
In this paper, we give a new method for constructing LCD codes. We employ group rings and a well known map that sends group ring elements to a subring of the $n times n$ matrices to obtain LCD codes. Our construction method guarantees that our LCD co
des are also group codes, namely, the codes are ideals in a group ring. We show that with a certain condition on the group ring element $v,$ one can construct non-trivial group LCD codes. Moreover, we also show that by adding more constraints on the group ring element $v,$ one can construct group LCD codes that are reversible. We present many examples of binary group LCD codes of which some are optimal and group reversible LCD codes with different parameters.
We explore the problem of deriving a posteriori probabilities of being defective for the members of a population in the non-adaptive group testing framework. Both noiseless and noisy testing models are addressed. The technique, which relies of a trel
lis representation of the test constraints, can be applied efficiently to moderate-size populations. The complexity of the approach is discussed and numerical results on the false positive probability vs. false negative probability trade-off are presented.
In this paper, we clarify some aspects on LCD codes in the literature. We first prove that a non-free LCD code does not exist over finite commutative Frobenius local rings. We then obtain a necessary and sufficient condition for the existence of LCD
code over finite commutative Frobenius rings. We later show that a free constacyclic code over finite chain ring is LCD if and only if it is reversible, and also provide a necessary and sufficient condition for a constacyclic code to be reversible over finite chain rings. We illustrate the minimum Lee-distance of LCD codes over some finite commutative chain rings and demonstrate the results with examples. We also got some new optimal $mathbb{Z}_4$ codes of different lengths {which are} cyclic LCD codes over $mathbb{Z}_4$.
Given a commutative ring $R$ with identity, a matrix $Ain M_{stimes l}(R)$, and $R$-linear codes $mathcal{C}_1, dots, mathcal{C}_s$ of the same length, this article considers the hull of the matrix-product codes $[mathcal{C}_1 dots mathcal{C}_s],A$.
Consequently, it introduces various sufficient conditions under which $[mathcal{C}_1 dots mathcal{C}_s],A$ is a linear complementary dual (LCD) code. As an application, LCD matrix-product codes arising from torsion codes over finite chain rings are considered. Highlighting examples are also given.
We will discuss superimposed codes and non-adaptive group testing designs arising from the potentialities of compressed genotyping models in molecular biology. The given paper was motivated by the 30th anniversary of Dyachkov-Rykov recurrent upper bo
und on the rate of superimposed codes published in 1982. We were also inspired by recent results obtained for non-adaptive threshold group testing which develop the theory of superimposed codes
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
