On perfect ternary constant weight codes

From MaRDI portal





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.




Cited in
(28)








This page was built for publication: On perfect ternary constant weight codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1591632)