Position recovery using binary sequences

Benjamin Arazi · Electronics Letters · 1984

It is shown how to arrange a sequence of 2n−1 bits on the circumference of a rotating device, such that the location of any specified bit is instantly recovered from the values of 2n+1 bits, sensed by fixed contacts.

Read the paper · More papers on PaperTik