On a lower bound on the number of perfect binary codes (Q4936733): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1685365 |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| 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 | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0166-218x(02)00302-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1976917113 / rank | |||
Normal rank | |||
Latest revision as of 09:41, 30 July 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
