A generalization of cyclic code equivalence algorithm to constacyclic codes
نویسندگان
چکیده
Recently, a new algorithm to test equivalence of two cyclic codes has been introduced which is efficient and produced useful results. In this work, we generalize constacyclic codes. As an application the found many with good parameters properties. particular, 22 that improve minimum distances best known linear (BKLCs).
منابع مشابه
On quasi-cyclic codes as a generalization of cyclic codes
In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic codes of length lm and ideals of Ml(Fq)[X]/(X m −1). This permits to construct new classes of codes, namely quasi-BCH and quasi-evaluation codes. We study th...
متن کاملCyclic and constacyclic codes over a non-chain ring
In this study, we consider linear and especially cyclic codes over the non-chain ring Zp[v]/〈v − v〉 where p is a prime. This is a generalization of the case p = 3. Further, in this work the structure of constacyclic codes are studied as well. This study takes advantage mainly from a Gray map which preserves the distance between codes over this ring and p-ary codes and moreover this map enlighte...
متن کاملA circulant approach to skew-constacyclic codes
We introduce circulant matrices that capture the structure of a skew-polynomial ring F[x; θ] modulo the left ideal generated by a polynomial of the type x − a. This allows us to develop an approach to skew-constacyclic codes based on such circulants. Properties of these circulants are derived, and in particular it is shown that the transpose of a certain circulant is a circulant again. This rec...
متن کاملa generalization of strong causality
در این رساله t_n - علیت قوی تعریف می شود. این رده ها در جدول علیت فضا- زمان بین علیت پایدار و علیت قوی قرار دارند. یک قضیه برای رده بندی آنها ثابت می شود و t_n- علیت قوی با رده های علی کارتر مقایسه می شود. همچنین ثابت می شود که علیت فشرده پایدار از t_n - علیت قوی نتیجه می شود. بعلاوه به بررسی رابطه نظریه دامنه ها با نسبیت عام می پردازیم و ثابت می کنیم که نوع خاصی از فضا- زمان های علی پایدار, ب...
Constacyclic Codes and Cocycles
Constacyclic codes may naturally be viewed as objects arising from the cohomological concept of a cocycle. Cohomology theory suggests a transformation which is used to show, under certain circumstances, a cyclic code of length mn over a ring R is isomorphic to the direct sum of m constacyclic codes of length n. In particular this isomorphism holds in many local rings (for example Galois rings) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2022
ISSN: ['0925-1022', '1573-7586']
DOI: https://doi.org/10.1007/s10623-022-01124-1