[r-t] Coset labeling
graham at changeringing.co.uk
Sun Nov 20 14:02:46 UTC 2011
I have used your approach (for example in multipart proving), but converted
the lexicographically least label into a unique hash between 0 and !labels.
Doesn't your algorithm just need to convert x into a unique hash with a
maximum value of |G| by combining the unique hashes relating to each coset?
The lookup table size could be further reduced by a factor of 2 for each
coset that only contains values of the same nature, although this would not
give any speed benefit.
More information about the ringing-theory