On perfect ternary constant weight codes (Q1591632)

From MaRDI portal
Revision as of 09:50, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
On perfect ternary constant weight codes
scientific article

    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
    0 references
    0 references

    Identifiers