On the asymptotic number of non-equivalent binary linear codes

DOI10.1016/j.ffa.2005.09.002zbMath1176.94070OpenAlexW2013883734MaRDI QIDQ946885

Xiang-Dong Hou

Publication date: 25 September 2008

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

Full work available at URL: https://doi.org/10.1016/j.ffa.2005.09.002

zbMATH Keywords

equivalenceinvariant subspacesymmetric groupasymptoticbinary linear code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (3)

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

• On the character of \(S_{n}\) acting on subspaces of \(\mathbb F_q^n\)
• Rigid linear binary codes
• The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids
• Analytic Number Theory
• The Invariant Subspace Lattice of a Linear Transformation

This page was built for publication: On the asymptotic number of non-equivalent binary linear codes