Inductive construction of perfect ternary constant-weight codes with distance 3 (Q5951357)
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 1685488
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inductive construction of perfect ternary constant-weight codes with distance 3 |
scientific article; zbMATH DE number 1685488 |
Statements
Inductive construction of perfect ternary constant-weight codes with distance 3 (English)
0 references
2 December 2002
0 references
The author shows that perfect \((n,3;n-1)_3\) codes (ternary constant-weight codes of length \(n\) and weight \(n-1\) with distance 3) correspond to perfect matchings without parallel edges at distance 1 or 2 from each other in a binary hypercube. Then inductive constructions of perfect \((n,3;n-1)_3\) codes are proposed that are analogs of some constructions of nonlinear perfect binary codes. The author also presents a construction that yields the lower bound \(2^{2^{n/2-2}}\) for the number of perfect \((n,3;n-1)_3\) codes.
0 references
perfect codes
0 references
ternary constant-weight codes
0 references
perfect matchings
0 references
lower bound
0 references
0.9004830718040466
0 references
0.8803188800811768
0 references
0.83843594789505
0 references
0.8366646766662598
0 references
