For , 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 .
// Target: algebra.bigb
Articles by others on the same topic
There are currently no matching articles.