The asymptotic number of binary codes and binary matroids
<|reference_start|>The asymptotic number of binary codes and binary matroids: The asyptotic number of nonequivalent binary n-codes is determined. This is also the asymptotic number of nonisomorphic binary n-matroids. The connection to a result of Lefmann, Roedl, Phelps is explored. The latter states that almost all binary n-codes have a trivial automorphism group.<|reference_end|>
@article{wild2004the,
    title={The asymptotic number of binary codes and binary matroids},
    author={Marcel Wild},
    journal={SIAM Journal of Discrete Mathematics 19 (2005) 691-699},
    year={2004},
    archivePrefix={arXiv},
    eprint={cs/0408011},
    primaryClass={cs.IT cs.DM math.IT}
}