Good recursive towers over prime fields exist (Q2200776): Difference between revisions

Let \(\mathbb{F}_{q}\) be a finite field with \(q=p^{n}\) elements, where \(p\) is a prime and \(n\) a positive integer. In this paper, the authors exhibit for every \(q>3\) a good recursive tower \(\mathcal{T}=(X_{m})_{m\in\mathbb{N}}\) over \(\mathbb{F}_{q}\) with limit \(\lambda(\mathcal{T})\) satisfying \[ \lambda(\mathcal{T})\geqslant \frac{2}{q-2}. \] In particular, for \(p\neq 2,3\), this gives a positive answer to the existence of good recursive towers in cases in which \(n=1\).