کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4582721 1630370 2015 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On the complexity of a family of Legendre sequences with irreducible polynomials
ترجمه فارسی عنوان
در پیچیدگی یک خانواده از توالی های لژاندر با چندجملهای نامتناهی
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات اعداد جبر و تئوری
چکیده انگلیسی

Ahlswede, Khachatrian, Mauduit and Sárközy [1] introduced the f-complexity measure (“f” for family) in order to study pseudorandom properties of large families of binary sequences. So far several families have been studied by this measure. In the present paper I considerably improve on my earlier result in [8], where the f  -complexity measure of a family based on the Legendre symbol and polynomials over FpFp is studied. This paper also extends the earlier results to a family restricted on irreducible polynomials.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Finite Fields and Their Applications - Volume 33, May 2015, Pages 175–186
نویسندگان
,