The asymptotic number of binary codes and binary matroids
classification
💻 cs.IT
cs.DMmath.IT
keywords
binarynumberasymptoticn-codesalmostasyptoticautomorphismcodes
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.