کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5771570 | 1630355 | 2017 | 24 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Locality of optimal binary codes
ترجمه فارسی عنوان
محل کد های باینری بهینه
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
اعداد جبر و تئوری
چکیده انگلیسی
The locality of locally repairable codes (LRCs) for a distributed storage system is the number of nodes that participate in the repair of failed nodes, which characterizes the repair cost. In this paper, we first determine the locality of MacDonald codes, then propose three constructions of LRCs with r=1,2 and 3. Based on these results, for 2â¤kâ¤7 and nâ¥k+2, we give an optimal linear [n,k,d] code with small locality. The distance optimality of these linear codes can be judged by the codetable of M. Grassl for n<2(2kâ1) and by the Griesmer bound for nâ¥2(2kâ1). Almost all the [n,k,d] codes (2â¤kâ¤7) have locality râ¤3 except for the three codes, and most of the [n,k,d] code with n<2(2kâ1) achieves the Cadambe-Mazumdar bound for LRCs.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Finite Fields and Their Applications - Volume 48, November 2017, Pages 371-394
Journal: Finite Fields and Their Applications - Volume 48, November 2017, Pages 371-394
نویسندگان
Qiang Fu, Ruihu Li, Luobin Guo, Liangdong Lv,