On the asymptotic number of inequivalent binary self-dual codes
The author obtains an asymptotic formula for the number of inequivalent binary self dual codes. By slightly modifying the proof of this result he also obtained a slightly modified asymptotic formula for the number of inequivalent doubly even binary self dual codes. The proof of the asymptotic formulas is based on the Cauchy-Frobenius Lemma (Burnsides Lemma) expressing the number of inequivalent binary self dual codes in terms of the number of codes fixed by a given permutation, summing over all permutations and dividing by the order of the appropriate symmetric group. The last sum is split into the term belonging to the identity permutation and the rest. It is then proved that the term belonging to the identity permutation is the dominant term and the rest is insignificant compared to that term. Moreover the dominant term equals the number of self dual codes divided by the order of the appropriate symmetric group. To prove that the term belonging to the identity is the dominant term is rather hard work, discriminating between a lot of cases and performing lots of nasty calculations and estimates. Nevertheless the proof seems to be sound, however it uses a result of an earlier paper (given in equation 3.7 of the present paper) of this author, which I did not check upon.
- 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 DE number 1382062
- Almost all self-dual codes are rigid
- Analytic Number Theory
- Asymptotic numbers of non-equivalent codes in three notions of equivalence
- Fundamentals of Error-Correcting Codes
- Graphs on unlabelled nodes with a given number of edges
- scientific article; zbMATH DE number 193020 (Why is no real title available?)
- scientific article; zbMATH DE number 3458752 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3636243 (Why is no real title available?)
- On the asymptotic number of non-equivalent \(q\)-ary linear codes.
- On the character of \(S_{n}\) acting on subspaces of \(\mathbb F_q^n\)
- On the enumeration of self-dual codes
- Paths in graphs
- The Asymptotic Number of Binary Codes and Binary Matroids
- The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids
- The binary self-dual codes of length up to 32: A revised enumeration
- Asymptotic bound on binary self-orthogonal codes
- The average intersection number of a pair of self-dual codes
- The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids
- On the asymptotic number of non-equivalent \(q\)-ary linear codes.
- On the Number of Inequivalent Binary Self-Orthogonal Codes
- Asymptotic numbers of non-equivalent codes in three notions of equivalence
- scientific article; zbMATH DE number 493090 (Why is no real title available?)
- New asymptotic bounds for self-dual codes and lattices
- The Asymptotic Number of Binary Codes and Binary Matroids
- Necessary conditions for reversed Dickson polynomials to be permutational
- Homomorphisms from the Coxeter graph
- The distance function on Coxeter-like graphs and self-dual codes
- Classification of self dual quadratic bent functions
- On the asymptotic number of non-equivalent binary linear 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)
