Construction of perfect \(q\)-ary codes by sequential switchings of \(\tilde\alpha\)-components (Q2388466)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Construction of perfect \(q\)-ary codes by sequential switchings of \(\tilde\alpha\)-components |
scientific article |
Statements
Construction of perfect \(q\)-ary codes by sequential switchings of \(\tilde\alpha\)-components (English)
0 references
14 September 2005
0 references
In this article, a construction of perfect \(q\)-ary codes with distance 3 using sequential switchings of special-type components is suggested. This construction is a generalization to the \(q\)-ary case of the method for constructing binary perfect codes by sequential switchings of special-type components. The construction yields a lower bound on the number of different perfect \(q\)-ary codes. Previously, no lower bound for the number of perfect \(q\)-ary codes had actually been computed.
0 references
perfect code
0 references
Hamming code
0 references
bound
0 references
Steiner triple system
0 references
special-type component
0 references
