Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions (Q6052708)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions |
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
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
