3 search results - page 1 / 1 » Gray-ordered Binary Necklaces |
COMBINATORICS
2007
14 years 11 months ago
2007
A k-ary necklace of order n is an equivalence class of strings of length n of symbols from {0, 1, . . . , k − 1} under cyclic rotation. In this paper we define an ordering on t...
81
Voted
SPIRE
2005
Springer
15 years 5 months ago
2005
Springer
Given two n-bit (cyclic) binary strings, A and B, represented on a circle (necklace instances). Let each sequence have the same number k of 1’s. We are interested in computing th...
124
Voted
TIT
2008
14 years 11 months ago
2008
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...