کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10118273 | 1630349 | 2018 | 15 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On the list decodability of self-orthogonal rank-metric codes
ترجمه فارسی عنوان
در لیست رمزگشایی کدهای ردیف مرتبه خودتنظیم
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
اعداد جبر و تئوری
چکیده انگلیسی
Guruswami and Resch proved that a random Fq-linear rank-metric code is list decodable with list decoding radius attaining the Gilbert-Varshamov bound [8]. Furthermore, in Hamming metric, random linear self-orthogonal codes can be list decoded up to the Gilbert-Varshamov bound with polynomial list size [11]. Motivated by these two results and the potential applications of self-orthogonal rank-metric codes in network coding and cryptography [20], [18] and [5], we focus on investigating their list decodability. In this paper, we prove that with high probability, a random Fq-linear self-orthogonal rank-metric code over FqnÃm can be list decoded up to the Gilbert-Varshamov bound with polynomial list size. In addition, we show that an Fqm-linear self-orthogonal rank-metric code of rate up to the Gilbert-Varshamov bound with exponential list size.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Finite Fields and Their Applications - Volume 54, November 2018, Pages 273-287
Journal: Finite Fields and Their Applications - Volume 54, November 2018, Pages 273-287
نویسندگان
Shu Liu,