Han and Ren's maximal-length conjecture for MDS elliptic codes

Let $\mathcal{E}$ be an elliptic curve over $\mathbb{F}_q$, and let $C_L(D,G)$ be an $[n,k]$ MDS code from $\mathcal{E}$. Assume that $3\leq k\leq n-3$. Han and Ren's conjecture. If $q$ is sufficiently large, then

$$n\leq \frac{\#\mathcal{E}(\mathbb{F}_q)}{2}.$$

This conjecture gives a maximal-length upper bound in terms of the number of rational points on the elliptic curve. The supplied text does not indicate whether it has been resolved.