| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8902899 | Discrete Mathematics | 2018 | 12 Pages |
Abstract
In this paper we present two cyclic Gray codes for signed involutions. The first one has a natural construction, implemented by a CAT algorithm, based in the recursive formula for the number of signed involutions. The second code, although with a higher computational cost, has the smallest possible Hamming distance for this family of objects.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gonçalo Gutierres, Ricardo Mamede, José Luis Santos,