اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn Completely Regular Codes
88
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This work is a survey on completely regular codes. Known properties, relations with other combinatorial structures and constructions are stated. The existence problem is also discussed and known results for some particular cases are established. In particular, we present a few new results on completely regular codes with covering radius 2 and on extended completely regular codes.
قيم البحث
اقرأ أيضاً
Given a parity-check matrix $H_m$ of a $q$-ary Hamming code, we consider a partition of the columns into two subsets. Then, we consider the two codes that have these submatrices as parity-check matrices. We say that anyone of these two codes is the s
upplementary code of the other one. We obtain that if one of these codes is a Hamming code, then the supplementary code is completely regular and completely transitive. If one of the codes is completely regular with covering radius $2$, then the supplementary code is also completely regular with covering radius at most $2$. Moreover, in this case, either both codes are completely transitive, or both are not. With this technique, we obtain infinite families of completely regular and completely transitive codes which are quasi-perfect uniformly packed.
We construct new families of completely regular codes by concatenation methods. By combining parity check matrices of cyclic Hamming codes, we obtain families of completely regular codes. In all cases, we compute the intersection array of these codes
. We also study when the extension of these codes gives completely regular codes. Some of these new codes are completely transitive.
In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius $rho$ equal to $3$ or $4$, and are $1/2^i$-th parts, for $iin{1,ldots,u}$ of binary (respectively, extended binary) Hamming co
des of length $n=2^m-1$ (respectively, $2^m$), where $m=2u$. In the usual way, i.e., as coset graphs, infinite families of embedded distance-regular coset graphs of diameter $D$ equal to $3$ or $4$ are constructed. In some cases, the constructed codes are also completely transitive codes and the corresponding coset graphs are distance-transitive.
A known Kronecker construction of completely regular codes has been investigated taking different alphabets in the component codes. This approach is also connected with lifting constructions of completely regular codes. We obtain several classes of c
ompletely regular codes with different parameters, but identical intersection array. Given a prime power $q$ and any two natural numbers $a,b$, we construct completely transitive codes over different fields with covering radius $rho=min{a,b}$ and identical intersection array, specifically, one code over $F_{q^r}$ for each divisor $r$ of $a$ or $b$. As a corollary, for any prime power $q$, we show that distance regular bilinear forms graphs can be obtained as coset graphs from several completely regular codes with different parameters. Under the same conditions, an explicit construction of an infinite family of $q$-ary uniformly packed codes (in the wide sense) with covering radius $rho$, which are not completely regular, is also given.
For any integer $rho geq 1$ and for any prime power q, the explicit construction of a infinite family of completely regular (and completely transitive) q-ary codes with d=3 and with covering radius $rho$ is given. The intersection array is also compu
ted. Under the same conditions, the explicit construction of an infinite family of q-ary uniformly packed codes (in the wide sense) with covering radius $rho$, which are not completely regular, is also given. In both constructions the Kronecker product is the basic tool that has been used.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
