The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids

DOI10.1006/ffta.1999.0273zbMath1006.94030OpenAlexW2075650493MaRDI QIDQ1570229

Marcel Wild

Publication date: 6 January 2002

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/ffta.1999.0273

zbMATH Keywords

binary codesbinary matroids

Mathematics Subject Classification ID

Other types of codes (94B60) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (9)

On the character of \(S_{n}\) acting on subspaces of \(\mathbb F_q^n\) ⋮ On the asymptotic number of inequivalent binary self-dual codes ⋮ The number of flags in finite vector spaces: asymptotic normality and Mahonian statistics ⋮ On the asymptotic number of non-equivalent binary linear codes ⋮ Structural matrix algebras and their lattices of invariant subspaces ⋮ On the number of non-isomorphic matroids ⋮ Asymptotic numbers of non-equivalent codes in three notions of equivalence ⋮ Asymptotics of generalized Galois numbers via affine Kac-Moody algebras ⋮ On the asymptotic number of non-equivalent \(q\)-ary linear codes.

Cites Work

• Gluings of modular lattices
• Axiomatizing simple binary matroids by their closed circuits
• Consequences of the Brylawski-Lucas theorem for binary matroids
• The Invariant Subspace Lattice of a Linear Transformation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids