On the asymptotic number of inequivalent binary self-dual codes

DOI10.1016/J.JCTA.2006.07.003zbMATH Open1145.94015OpenAlexW1984060289MaRDI QIDQ878956FDOQ878956

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

Recommendations

• On the Number of Inequivalent Binary Self-Orthogonal Codes
• On the asymptotic number of non-equivalent binary linear codes
• scientific article; zbMATH DE number 3887598
• On the classification and enumeration of self-dual codes
• On the classification and enumeration of self-dual codes
• The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids
• New asymptotic bounds for self-dual codes and lattices
• Asymptotic bound on binary self-orthogonal codes
• ON BINARY EXTREMAL FORMALLY SELF-DUAL EVEN CODES
• scientific article

zbMATH Keywords

invariant subspaceasymptotic enumerationdoubly evenequivalency

Mathematics Subject Classification ID

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

Cites Work

• On the enumeration of self-dual codes
• The binary self-dual codes of length up to 32: A revised enumeration
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fundamentals of Error-Correcting Codes
• Paths in graphs
• Title not available (Why is that?)
• Analytic Number Theory
• The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids
• On the character of \(S_{n}\) acting on subspaces of \(\mathbb F_q^n\)
• Almost all self-dual codes are rigid
• 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
• The Asymptotic Number of Binary Codes and Binary Matroids

Cited In (12)

• Asymptotic numbers of non-equivalent codes in three notions of equivalence
• The Asymptotic Number of Binary Codes and Binary Matroids
• On the asymptotic number of non-equivalent binary linear codes
• Asymptotic bound on binary self-orthogonal codes
• Title not available (Why is that?)
• The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids
• Classification of self dual quadratic bent functions
• The average intersection number of a pair of self-dual codes
• Necessary conditions for reversed Dickson polynomials to be permutational
• New asymptotic bounds for self-dual codes and lattices
• On the asymptotic number of non-equivalent \(q\)-ary linear codes.
• On the Number of Inequivalent Binary Self-Orthogonal Codes

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

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