Although efficient algorithms for generating minimum-weight and maximum-weight universal cycles are given in[25](and generalized in[26]), there are several advantages to our new results. Firstly, our new universal cycles are the lexicographi-cally smallest, whereas the constructions in[23,25,26]are not. Secondly, the constructions in[25,26]are based on cutting and pasting dual-weight universal cycles from[23], whereas our new construction is much simpler. Thirdly, our new con-structions are based on lexicographic order, whereas the constructions in[25,26]are complicated by their use of ‘cool-lex’ order. (The construction in[25]was simplified by a generalized version of cool-lex order found in[28], although that article did not include an efficient algorithm.)
The lexicographically smallest universal cycle for binary strings with minimum specified weight
lexicographically