In coding theory, we know that if you take the function

\begin{equation} \alpha_q(\delta) := \limsup_{n \rightarrow \infty} \ \max \{ R(C) \mid \delta(C) \ge \delta \mid C \subseteq \mathbb{F}_q^n\}. \end{equation}

then the function is continuous. Here $R(C)$ is the rate of a code $C$ and $\delta(C)$ the relative minimum distance. This follows by spoiling a code appropriately to have codes in the vicinity of any point in the graph. A proof is in Tsfasman and Vladut's "Algebraic-geometric codes" book, for example.

I think the original proof is by Manin, but I am not sure (would like to know!)

Now if I restrict only to cyclic codes and define a similar function as the following:

\begin{equation} \alpha_q^{\text{cyclic}}(\delta) := \limsup_{n \rightarrow \infty} \ \max \{ R(C) \mid \delta(C) \ge \delta \mid C \text{ is cyclic} \}. \label{eq:defi_of_Alp_cyc} \end{equation}

Is it known that this function is also continuous? The usual proof for the general case cannot be extended (as far as I could tell).

EDIT: This question is an open problem, because it proves an open problem.

However, I am now changing my demand. Instead of 'cyclic', I can choose other class of codes like 'Goppa' codes or 'transitive' codes and make similar constructions $\alpha_q^{\text{Goppa}}$ or $\alpha_q^{\text{trans}}$ for instance. Are any such functions known to be continuous?