The Asymptotic Number of Binary Codes and Binary Matroids
From MaRDI portal
(Redirected from The Asymptotic Number of Binary Codes and Binary Matroids)
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.
Recommendations
- The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids
- On the asymptotic number of non-equivalent binary linear codes
- On binary \(k\)-paving matroids and Reed-Muller codes
- scientific article; zbMATH DE number 3695081
- Codes, arrangements and matroids
- On the asymptotic number of inequivalent binary self-dual codes
- A note on matroids, codes and information theory
- A note on the Assmus-Mattson theorem for some binary codes
- On the number of circuits in regular matroids (with connections to lattices and codes)
- On the number of circuits in regular matroids (with connections to lattices and codes)
Cited in
(7)- The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids
- On binary \(k\)-paving matroids and Reed-Muller codes
- The number of flags in finite vector spaces: asymptotic normality and Mahonian statistics
- Asymptotics of generalized Galois numbers via affine Kac-Moody algebras
- Asymptotic numbers of non-equivalent codes in three notions of equivalence
- Dominic Welsh: his work and influence
- On the asymptotic number of inequivalent binary self-dual codes
This page was built for publication: The Asymptotic Number of Binary Codes and Binary Matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470787)
