Mapping prefer-opposite to prefer-one de Bruijn sequences
The mapping is based on the differentiation operator D (< b(1), . . . , b(l)>) = < b(2)-b(1), b(3)-b(2), . . . , b(l)-b(l-1)> where bit subtraction is modulo two. We show that if we take the prefer-opposite sequence < b(1), b(2), . . . , b(2n)>,...