The Asymptotic Number of Binary Codes and Binary Matroids

DOI10.1137/S0895480104445538zbMath1096.94050arXivcs/0408011OpenAlexW2114834823MaRDI QIDQ5470787

Marcel Wild

Publication date: 1 June 2006

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0408011

zbMATH Keywords

binary codesasymptotic enumerationbinary matroidslattice of invariant subspaces

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (4)

On the asymptotic number of inequivalent binary self-dual codes ⋮ The number of flags in finite vector spaces: asymptotic normality and Mahonian statistics ⋮ Asymptotic numbers of non-equivalent codes in three notions of equivalence ⋮ Asymptotics of generalized Galois numbers via affine Kac-Moody algebras

This page was built for publication: The Asymptotic Number of Binary Codes and Binary Matroids