CONSTRUCTION OF NEW CODES
محل انتشار: سیزدهمین کنفرانس نظریه گراف و ترکیبیات جبری
سال انتشار: 1404
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 107
نسخه کامل این مقاله ارائه نشده است و در دسترس نمی باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
GTACCA01_076
تاریخ نمایه سازی: 19 مرداد 1404
چکیده مقاله:
In this paper, we introduce a new construction of codes, which we called Combined Construction, which allows the combination of codes with different properties (for example, a cyclic code with the ability to correct burst errors and a linear code with the ability to correct random errors), which can be combined together by direct sum. In this regard, we assume that there are several finite blocks of cyclic codes and, in order to make this structure more efficient, we combine them with a linear code that is not necessarily cyclic and study the properties of this code. By which we can obtain new codes with a greater rate from two given codes and also create a code with a larger Hamming distance or the ability to correct certain errors (for example, a combination of random and burst errors). We determine the structure of these combined codes giving the generator polynomials of these codes and we specify the form of their generator and parity check matrix. Our goal is to provide a new construction of codes, which can be a guide for researchers and engineers.
کلیدواژه ها:
نویسندگان
FATEMEH SEDIGHI
Department of Mathematics and Computer Sciences, Damghan University, Damghan, Iran.
ASADOLLAH FARAMARZI
Department of Mathematics and Computer Sciences, Damghan University, Damghan, Iran.