Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions (Q6052708)

From MaRDI portal
Revision as of 05:25, 3 August 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7751514
Language Label Description Also known as
English
Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions
scientific article; zbMATH DE number 7751514

    Statements

    Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions (English)
    0 references
    0 references
    17 October 2023
    0 references
    character
    0 references
    cycle
    0 references
    Gray
    0 references
    Hamming
    0 references
    relation
    0 references
    substitution
    0 references
    word
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers