On a lower bound on the number of perfect binary codes (Q4936733): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Sergey Artem'evich Malyugin / rank | |||
Property / author | |||
Property / author: Sergey Artem'evich Malyugin / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Construction of perfect binary codes by sequential shifts of \(\tilde\alpha\)-components / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 12:39, 29 May 2024
scientific article; zbMATH DE number 1396783
Language | Label | Description | Also known as |
---|---|---|---|
English | On a lower bound on the number of perfect binary codes |
scientific article; zbMATH DE number 1396783 |
Statements
On a lower bound on the number of perfect binary codes (English)
0 references
31 January 2000
0 references
different perfect binary codes
0 references
lower bound
0 references
switching of \(i\)-components
0 references