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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Mathematics of Computation of the American Mathematical Society
Paper Title
Journal
Date
