On the asymptotic number of non-equivalent \(q\)-ary linear codes.

DOI10.1016/j.jcta.2005.08.001zbMath1089.94035OpenAlexW1964163389MaRDI QIDQ2575811

Xiang-Dong Hou

Publication date: 6 December 2005

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2005.08.001

zbMATH Keywords

invariant subspacesymmetric group\(q\)-ary linear codesasymptoticwreath product

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

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

Cites Work

• Unnamed Item
• On the character of \(S_{n}\) acting on subspaces of \(\mathbb F_q^n\)
• On the asymptotic number of non-equivalent binary linear codes
• The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids
• Representations of permutation groups. Part I
• Analytic Number Theory
• The Invariant Subspace Lattice of a Linear Transformation

This page was built for publication: On the asymptotic number of non-equivalent \(q\)-ary linear codes.