 Asymptotic Gilbert–Varshamov bound

For $0\le \delta \le 1-1/q$, take logarithms of the Gilbert–Varshamov bound and apply the Hamming ball volume exponent. The Varshamov bound for linear codes gives the same achievable lower bound within linear codes for prime-power $q$.

// Target: algebra.bigb