کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4583550 | 1333912 | 2006 | 24 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Multi-continued fraction algorithm and generalized B–M algorithm over Fq
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
An iterative algorithm in solving the linear synthesis problem on multi-sequences over finite fields is derived from the multi-strict continued fraction algorithm (m-SCFA in short). It is interesting that the derived iterative algorithm is the same as the generalized Berlekamp–Massey algorithm (GBMA in short), though the computations in the m-SCFA and the GBMA are completely different. As a consequence, the minimal polynomials and the discrepancy sequence obtained by acting GBMA on a multi-sequence are expressed explicitly by data associated to the multi-strict continued fraction expansion of .
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Finite Fields and Their Applications - Volume 12, Issue 3, July 2006, Pages 379-402
Journal: Finite Fields and Their Applications - Volume 12, Issue 3, July 2006, Pages 379-402