On the asymptotic number of non-equivalent binary linear codes

DOI10.1016/J.FFA.2005.09.002MaRDI QIDQ946885zbMATH OpenOpenAlexFDO

Authors 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

asymptoticinvariant subspaceequivalencesymmetric groupbinary linear code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids
• Asymptotic numbers of non-equivalent codes in three notions of equivalence
• On the asymptotic number of non-equivalent \(q\)-ary linear codes.
• Rigid linear binary codes
• On the asymptotic number of inequivalent binary self-dual codes

Cites work

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

Cited in

(8)

• The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids
• Asymptotics of generalized Galois numbers via affine Kac-Moody algebras
• Asymptotic numbers of non-equivalent codes in three notions of equivalence
• The nonexistence of certain binary linear codes
• On the asymptotic number of inequivalent binary self-dual codes
• The Asymptotic Number of Binary Codes and Binary Matroids
• On the asymptotic number of non-equivalent \(q\)-ary linear codes.
• The asymptotic number of solutions of a diophantine equation from coding theory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q946885)