کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5771640 | 1630359 | 2017 | 22 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On the next-to-minimal weight of affine cartesian codes
ترجمه فارسی عنوان
در وزن بعدی به حداقل وزن از کدهای دکارت وابسته
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
اعداد جبر و تئوری
چکیده انگلیسی
In this paper we determine many values of the second least weight of codewords, also known as the next-to-minimal Hamming weight, for a type of affine variety codes, obtained by evaluating polynomials of degree up to d on the points of a cartesian product of n subsets of a finite field Fq. Such codes firstly appeared in a work by O. Geil and C. Thomsen (see [12]) as a special case of the so-called weighted Reed-Muller codes, and later appeared independently in a work by H. López, C. RenterÃa-Marquez and R. Villarreal (see [16]) named as affine cartesian codes. Our work extends, to affine cartesian codes, the results obtained by Rolland in [17] for generalized Reed-Muller codes.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Finite Fields and Their Applications - Volume 44, March 2017, Pages 113-134
Journal: Finite Fields and Their Applications - Volume 44, March 2017, Pages 113-134
نویسندگان
CÃcero Carvalho, Victor G.L. Neumann,