Abstract
Some theoretical results and computational algorithms are described which verify previous calculations, prove some theoretical nonexistence results, and totally enumerate all inequivalent Turyn sequences of length less than 43, that is, the longer sequence has length less than 43.
Publication Details
Genet M'gan Edmonson, Jennifer Seberry and Malcolm Anderson, On the existence of Turyn sequences of length less than 43, Mathematics of Computation, 62, (1994), 351-362.