Skip to main content
placeholder image

On the existence of turyn sequences of length less than 43

Journal Article


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. © 1994 American Mathematical Society.

Publication Date


  • 1994

Citation


  • Edmondson, G. M., Seberry, J., & Anderson, M. R. (1994). On the existence of turyn sequences of length less than 43. Mathematics of Computation, 62(205), 351-362. doi:10.1090/S0025-5718-1994-1203733-8

Scopus Eid


  • 2-s2.0-84968484581

Web Of Science Accession Number


Start Page


  • 351

End Page


  • 362

Volume


  • 62

Issue


  • 205

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. © 1994 American Mathematical Society.

Publication Date


  • 1994

Citation


  • Edmondson, G. M., Seberry, J., & Anderson, M. R. (1994). On the existence of turyn sequences of length less than 43. Mathematics of Computation, 62(205), 351-362. doi:10.1090/S0025-5718-1994-1203733-8

Scopus Eid


  • 2-s2.0-84968484581

Web Of Science Accession Number


Start Page


  • 351

End Page


  • 362

Volume


  • 62

Issue


  • 205