On perfect ternary constant weight codes (Q1591632)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On perfect ternary constant weight codes |
scientific article; zbMATH DE number 1548349
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On perfect ternary constant weight codes |
scientific article; zbMATH DE number 1548349 |
Statements
On perfect ternary constant weight codes (English)
0 references
1 January 2001
0 references
A sequence of perfect ternary constant-weight codes of length \(2^r\), weight \(2^r-1\) and minimum distance 3 is presented. The construction is based on binary Hamming codes. It is shown that these parameters are the only ones for which a perfect single error correcting ternary code can exist.
0 references
constant-weight codes
0 references
ternary codes
0 references
perfect codes
0 references
