Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions (Q6052708): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2023.114175 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2023.114175 / rank | |||
Normal rank | |||
Latest revision as of 17:59, 30 December 2024
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
0 references
0 references
0 references
