On the asymptotic number of inequivalent binary self-dual codes

DOI10.1016/J.JCTA.2006.07.003zbMath1145.94015OpenAlexW1984060289MaRDI QIDQ878956

Xiang-Dong Hou

Publication date: 4 May 2007

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.2006.07.003

zbMATH Keywords

invariant subspaceasymptotic enumerationequivalencydoubly even

Mathematics Subject Classification ID

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

Related Items (2)

Necessary conditions for reversed Dickson polynomials to be permutational ⋮ Classification of self dual quadratic bent functions

Cites Work

• On the character of \(S_{n}\) acting on subspaces of \(\mathbb F_q^n\)
• On the enumeration of self-dual codes
• The binary self-dual codes of length up to 32: A revised enumeration
• Almost all self-dual codes are rigid
• The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids
• Graphs on unlabelled nodes with a given number of edges
• On the asymptotic number of non-equivalent \(q\)-ary linear codes.
• Asymptotic numbers of non-equivalent codes in three notions of equivalence
• Analytic Number Theory
• Fundamentals of Error-Correcting Codes
• Paths in graphs
• The Asymptotic Number of Binary Codes and Binary Matroids
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the asymptotic number of inequivalent binary self-dual codes