The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids (Q1570229)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids
scientific article

    Statements

    The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids (English)
    0 references
    0 references
    6 January 2002
    0 references
    It is known that the number \(b(n)\) of inequivalent binary codes of length \(n\) gives the number of nonisomorphic binary \(n\)-matroids. The paper provides the asymptotic value of the number \(b(n)\) as \(n\to\infty\). Asymptotically, \(b(n)\equiv G(n)/n!\), where \(G(n)\) is the number of linear subspaces of \(\text{GF}(2)^n\).
    0 references
    binary matroids
    0 references
    binary codes
    0 references

    Identifiers