The asymptotic number of binary codes and binary matroids
Information Theory
2017-03-01 v1 Discrete Mathematics
math.IT
Abstract
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.
Cite
@article{arxiv.cs/0408011,
title = {The asymptotic number of binary codes and binary matroids},
author = {Marcel Wild},
journal= {arXiv preprint arXiv:cs/0408011},
year = {2017}
}
Comments
12 pages