Theorem 7.3 on page 67 in these lecture notes states the following.
For every even power of a prime $q$, and every parameter $\delta < 1 - 1/(\sqrt{q} - 1)$, there exists an infinite family of $q$-ary linear codes of relative distane $\delta$ and rate $R \geq 1- \delta - 1/(\sqrt{q} - 1)$. Further a generator matrix for such a code can be construted in $\tilde{\mathcal{O}}(n^3)$ time, where $n$ is the length of the code.
While this is really nice in asymptotic contexts, I wonder how flexible one can choose the concrete parameters of these algebraic geometric codes. For example: Could one choose $q = 64, \delta = 0.19$ and $k = 2$ to have an $[3, 2, 1]_64$ code? Or phrased more generally: Which constraints are there on the choice of these parameters?
I tried reading the paper the theorem above is based on, but I am to unacquainted to algebraic geometry to answer the question myself.
There is no single theorem that says what parameters are possible.
If you Ctrl-F (or whatever equivalent) your document for “bound”, you will find several famous constrains on the relationship between code length, alphabet size and distance. That is what you are looking for, essentially.
In coding theory, you will encounter many families of codes, all of which have different properties and performance. All you can do is check their parameters. I don’t think it’s feasible to exhaustively search for combinations of parameters.