A class of perfect ternary constant-weight codes (Q1591634): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1008361925021 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1539721799 / rank | |||
Normal rank | |||
Latest revision as of 10:17, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A class of perfect ternary constant-weight codes |
scientific article |
Statements
A class of perfect ternary constant-weight codes (English)
0 references
1 January 2001
0 references
A class 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. The number of codewords is \(2^{2^r}-1\). For \(r=2\), the construction results in the subcode of the \([4,2,3]\) tetracode consisting of its nonzero codewords. These are the only perfect \(q\)-ary constant-weight codes known to date. These codes can be shortened twice to give two more classes of optimal codes.
0 references
constant-weight codes
0 references
ternary codes
0 references
perfect codes
0 references
