About this Event
135 N Skinker Blvd, St. Louis, MO 63112, USA
Skew-Tolerant Gray Codes - A Leap Forward
Skew-tolerant Gray codes are Gray codes in which changes in consecutive codewords occur in adjacent positions. They are motivated by application to position-measurement devices that are imperfectly constructed. We present the first construction of asymptotically non-vanishing skew-tolerant Gray codes, offering an exponential improvement over previous work. The codes admit linear-time encoding and decoding algorithms. We generalize the codes to $k$-skew-tolerance, and show that even for $k=2$ we can find complete codes. Finally, we extend the definition to non-binary alphabets, and provide constructions of complete $m$-ary skew-tolerant Gray codes for every base $m\geq 3$. The codes we found nearly solve a 46 year-old open question by Slater.
This is joint work with my PhD student, Gabriel Sac Himelfarb.
