De Bruijn Covering Codes for Rooted Hypergraphs

Joshua N. Cooper, Fan Chung

What is the length of the shortest sequence $S$ of reals so that the set of consecutive $n$-words in $S$ form a covering code for permutations on $\{1,2,>...,n\}$ of radius $R$ ?…