کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9497520 | 1630757 | 2005 | 22 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On the construction of tame towers over finite fields
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: On the construction of tame towers over finite fields On the construction of tame towers over finite fields](/preview/png/9497520.png)
چکیده انگلیسی
Recently, W.-C. W. Li, et al. (Lect. Notes in Comput. Sci. 2369 (2002) 372) developed a non-deterministic algorithm to perform a computer search for polynomials that recursively define asymptotically good sequences of function fields. In this paper, we build on this work by refining this algorithm. We give many sufficient conditions for the construction of such sequences and we describe the techniques used in the search. Many examples are given. The resulting towers are important for the construction of asymptotically good sequences of codes and they could provide further numerical evidence for Elkies' modularity conjecture.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Pure and Applied Algebra - Volume 199, Issues 1â3, 1 July 2005, Pages 197-218
Journal: Journal of Pure and Applied Algebra - Volume 199, Issues 1â3, 1 July 2005, Pages 197-218
نویسندگان
Hiren Maharaj, Jörg Wulftange,