Every binary (2/sup m/-2, 2/sup 2(m)-2-m/, 3) code can be lengthened to form a perfect code of length 2/sup m/-1 (Q4701314)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1365234
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every binary (2/sup m/-2, 2/sup 2(m)-2-m/, 3) code can be lengthened to form a perfect code of length 2/sup m/-1 |
scientific article; zbMATH DE number 1365234 |
Statements
Every binary (2/sup m/-2, 2/sup 2(m)-2-m/, 3) code can be lengthened to form a perfect code of length 2/sup m/-1 (English)
0 references
21 November 1999
0 references
lengthened code
0 references
perfect code
0 references
0.8095459938049316
0 references
0.788730263710022
0 references
0.7645794749259949
0 references
0.7635453939437866
0 references
