The asymptotic number of binary codes and binary matroids
Date
2006-08
Authors
Wild, Marcel
Journal Title
Journal ISSN
Volume Title
Publisher
Society for Industrial and Applied Mathematics (SIAM)
Abstract
The asymptotic number of nonequivalent binary n-codes is determined. This is also the asymptotic number of nonisomorphic binary matroids on n elements.
Description
The original publication is available at http://epubs.siam.org/
Keywords
Asymptotic enumeration, Binary codes, Binary matroids, Lattice of invariant subspaces
Citation
Wild, M. 2006. The asymptotic number of binary codes and binary matroids. SIAM Journal on Discrete Mathematics, 19(3):691-699, doi:10.1137/S0895480104445538.