کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
11024745 | 1701071 | 2019 | 25 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Some binary BCH codes with length nâ¯=â¯2mâ¯+â¯1
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Under research for nearly sixty years, Bose-Chaudhuri-Hocquenghem (BCH) codes have played increasingly important roles in many applications such as communication, data storage and information security. However, the dimension and minimum distance of BCH codes have been seldom solved by now because of their intractable characteristics. The objective of this paper is to study the dimensions of some binary BCH codes with length n=2m+1. Many new techniques are employed to investigate the coset leaders modulo n. For m=2t+1,4t+2,8t+4 and mâ¥10, the first five largest coset leaders modulo n are determined, and the dimensions of some BCH codes of length n with designed distance δ>2âm2â are presented. These new skills and results may be helpful to study other types of cyclic codes over finite fields.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Finite Fields and Their Applications - Volume 55, January 2019, Pages 109-133
Journal: Finite Fields and Their Applications - Volume 55, January 2019, Pages 109-133
نویسندگان
Yang Liu, Ruihu Li, Qiang Fu, Liangdong Lu, Yi Rao,