Sciweavers

3 search results - page 1 / 1
» Gray-ordered Binary Necklaces
Sort
View
COMBINATORICS
2007
70views more  COMBINATORICS 2007»
13 years 3 months ago
Gray-ordered Binary Necklaces
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...
Christopher Degni, Arthur A. Drisko
SPIRE
2005
Springer
13 years 9 months ago
Necklace Swap Problem for Rhythmic Similarity Measures
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...
Yoan José Pinzón Ardila, Raphaë...
TIT
2008
107views more  TIT 2008»
13 years 3 months ago
Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
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 ...
Igor Zinovik, Daniel Kroening, Yury Chebiryak