On a lower bound on the number of perfect binary codes
From MaRDI portal
Recommendations
Cited in
(15)- scientific article; zbMATH DE number 1811348 (Why is no real title available?)
- The Algebraic Degree of Perfect Binary Codes
- scientific article; zbMATH DE number 4218008 (Why is no real title available?)
- Upper bound for the number of perfect \((n,3)\)-codes
- scientific article; zbMATH DE number 850320 (Why is no real title available?)
- Structure of \(i\)-components of perfect binary codes
- On enumeration of the perfect binary codes of length 15
- scientific article; zbMATH DE number 1188975 (Why is no real title available?)
- A lower bound for 0,1,* tournament codes
- On the binary codes with parameters of doubly-shortened 1-perfect codes
- On perfect binary codes
- On the admissible families of components of Hamming codes
- scientific article; zbMATH DE number 6004916 (Why is no real title available?)
- On components of preparata codes
- Bounds for binary codes of length less than 25
This page was built for publication: On a lower bound on the number of perfect binary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4936733)