Asymptotic numbers of non-equivalent codes in three notions of equivalence

DOI10.1080/03081080701539023zbMath1166.94009OpenAlexW2012102311MaRDI QIDQ3615517

Xiang-Dong Hou

Publication date: 20 March 2009

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081080701539023

zbMATH Keywords

invariant subspacelinear codeasymptoticskew polynomialsemi-linear transformation

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Asymptotic enumeration (05A16)

Related Items (3)

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

Cites Work

• On the character of \(S_{n}\) acting on subspaces of \(\mathbb F_q^n\)
• On the asymptotic number of non-equivalent binary linear codes
• Cycle indices of linear, affine, and projective groups
• The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids
• On the asymptotic number of non-equivalent \(q\)-ary linear codes.
• Pseudo-linear transformations
• The Asymptotic Number of Binary Codes and Binary Matroids

This page was built for publication: Asymptotic numbers of non-equivalent codes in three notions of equivalence