Structure of i-components of perfect binary codes
From MaRDI portal
Structure of \(i\)-components of perfect binary codes
Recommendations
Cites work
- A Combinatorial Construction of Perfect Codes
- A new construction of group and nongroup perfect codes
- Code-generating factorizations of an \(n\)-dimensional unit cube and of perfect binary codes
- scientific article; zbMATH DE number 3831840 (Why is no real title available?)
- scientific article; zbMATH DE number 3499625 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3394025 (Why is no real title available?)
- scientific article; zbMATH DE number 3419034 (Why is no real title available?)
- scientific article; zbMATH DE number 4187720 (Why is no real title available?)
- On binary cyclic codes of odd lengths from 101 to 127
- On the Nonexistence of Perfect Codes over Finite Fields
- Perfect binary codes: bounds and properties
Cited in
(10)- Construction of perfect binary codes by sequential shifts of -components
- The extended 1-perfect trades in small hypercubes
- On components of preparata codes
- Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes
- On binary 1-perfect additive codes: some structural properties
- On a lower bound on the number of perfect binary codes
- Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph
- On perfect binary codes
- Switching codes and designs
- Tilings of nonorientable surfaces by Steiner triple systems
This page was built for publication: Structure of \(i\)-components of perfect binary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5939244)