کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
420036 | 683889 | 2013 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
(a,b)(a,b)-codes in Z/nZZ/nZ
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: (a,b)(a,b)-codes in Z/nZZ/nZ (a,b)(a,b)-codes in Z/nZZ/nZ](/preview/png/420036.png)
چکیده انگلیسی
Perfect weighted coverings of radius one have been studied in the Hamming metric and in the Lee metric. For practical reasons, we present them in a slightly different way, yet equivalent. Given an integer kk, the kk-neighborhood of an element is the set of elements at distance at most kk. Let aa and bb be two integers. An (a,b)(a,b)-code is a set of elements such that elements in the code have a+1a+1 elements belonging to the code in their kk-neighborhood and other elements have bb elements belonging to the code in their kk-neighborhood. In this paper, we study the (a,b)(a,b)-codes in Z/nZZ/nZ, where the distance between xx and yy is |x−y|mod[n]|x−y|mod[n] and we characterize the existence of a non trivial (a,b)(a,b)-code in Z/nZZ/nZ.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 161, Issues 4–5, March 2013, Pages 612–617
Journal: Discrete Applied Mathematics - Volume 161, Issues 4–5, March 2013, Pages 612–617
نویسندگان
Sylvain Gravier, Anne Lacroix, Souad Slimani,