On the asymptotic number of non-equivalent binary linear codes

Denote by b(n) the number of non-equivalent linear codes in and by Gn,2 the number of subspaces in . M. Wild gave a proof that . R. Lax pointed out that Wild's proof contains a gap which does not appear to have an easy fix. In this paper, we give a complete proof for the formula .