The average intersection number of a pair of self-dual codes
This paper is in continuation of the author's preceding paper published in this journal in 1989. The paper deals with an average intersection number of a pair of self-dual codes. In the beginning, the author gives a counterexample to one of the conjectures stated in his earlier paper proving thereby the invalidity of the conjecture. The main result of the paper presents approximations of the average intersection number for binary self-dual codes. The author further computes the second moments of intersection numbers and finally studies the average of the dimensions of intersections.
- Average of complete joint weight enumerators and self-dual codes
- Intersections of q-ary perfect codes
- On the asymptotic number of inequivalent binary self-dual codes
- A note on the intersection of two distinct constacyclic codes
- On the intersection of binary linear codes
- On the classification and enumeration of self-dual codes
- On the classification and enumeration of self-dual codes
- On dual toric complete intersection codes
- scientific article; zbMATH DE number 5054189
- Intersection of Hadamard Codes
This page was built for publication: The average intersection number of a pair of self-dual codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1185409)
