A class of perfect ternary constant-weight codes
From MaRDI portal
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.
Recommendations
Cited in
(18)- On perfect ternary constant weight codes
- Ternary constant weight codes
- Completely reducible super-simple designs with block size four and related super-simple packings
- On a class of optimal constant weight ternary codes
- Ternary Hamming and binary perfect covering codes
- On perfect constant weight codes
- Non-existence of a ternary constant weight (16,5,15;2048) diameter perfect code
- scientific article; zbMATH DE number 1498789 (Why is no real title available?)
- scientific article; zbMATH DE number 1522575 (Why is no real title available?)
- scientific article; zbMATH DE number 2154130 (Why is no real title available?)
- 4-\({}^{\ast}\text{GDD}(6^n)\)s and related optimal quaternary constant-weight codes
- Non-Binary Diameter Perfect Constant-Weight Codes
- Clique matchings in the \(k\)-ary \(n\)-dimensional cube
- Two classes of ternary codes and their weight distributions
- Inductive construction of perfect ternary constant-weight codes with distance 3
- A family of diameter perfect constant-weight codes from Steiner systems
- Construction of optimal ternary constant weight codes via Bhaskar Rao designs
- On diameter perfect constant-weight ternary codes
This page was built for publication: A class of perfect ternary constant-weight codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1591634)
